On functors expressible in the polymorphic typed lambda calculus (1990)

Cached

Download Links

by John C. Reynolds , Gordon D. Plotkin
Venue:Logical Foundations of Functional Programming
Citations:16 - 1 self

Documents Related by Co-Citation

417 The calculus of constructions – Coquand, G Huet - 1988
332 Types, abstraction and parametric polymorphism – J C Reynolds - 1983
339 Towards a theory of type structure – J C Reynolds
874 A theory of type polymorphism in programming – Robin Milner - 1978
146 Fundamental concepts in programming languages – C Strachey - 2000
46 Polymorphism is set theoretic, constructively – A M Pitts - 1987
112 Formal Parametric Polymorphism – Martin Abadi , Luca Cardelli, Pierre-Louis Curien - 1993
5 Formal Parametric Polymorphism, Theoretical Computer Science 121(1–2):9–58 – M Abadi, L Cardelli, P-L Curien - 1993
6 Non-trivial Power Types can't be Subtypes of Polymorphic Types – Andrew M. Pitts - 1989
40 Automatic synthesis of typed Λ-programs on term algebras – Corrado Böhm, Alessandro Berarducci - 1985
26 Categorical data types in parametric polymorphism – Ryu Hasegawa - 1994
235 Constructive mathematics and computer programming – Per Martin-Lof - 1982
267 G.D.: Abstract types have existential types – J C Mitchell, Plotkin - 1988
44 Automatic synthesis of typed -programs on term algebras – C Bohm, A Berarducci - 1985
325 Proofs and Types – J-Y Girard, Y Lafont, P Taylor - 1989
379 Introduction to Higher Order Categorical Logic – J Lambek, P J Scott - 1986
221 Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur. Thèse de Doctorat d’ État, Université de Paris VII – Jean-Yves Girard - 1972
3 Communication to the Types electronic forum – E Moggi - 1986
5 Introduction to Part II: Polymorphic Lambda Calculus – J C Reynolds - 1990