A New Characterization of Lambda Definability (1993)

Cached

Download Links

by Achim Jung , Jerzy Tiuryn
Citations:26 - 1 self

Documents Related by Co-Citation

58 Lambda-definability in the full type hierarchy – G Plotkin - 1980
213 Intensional Interpretations of Functionals of Finite Type – W W Tait - 1967
362 Types, Abstraction and Parametric Polymorphism – J C Reynolds - 1983
394 LCF considered as a programming language – G D Plotkin - 1977
730 Notions of Computation and Monads – Eugenio Moggi - 1991
470 A calculus of constructions – T Coquand, G Huet - 1988
66 Full Abstraction for PCF (Extended Abstract) – Samson Abramsky, Pasquale Malacaria, Radha Jagadeesan - 1994
43 Logical relation and the typed lambda calculus – R Statman - 1985
53 Types, Abstraction, and Parametric Polymorphism, Part 2 – QingMing Ma, John C. Reynolds - 1991
352 Proofs and Types – J-Y Girard, Y Lafont, P Taylor - 1989
11 Functional style in C++: Closures, late binding, and lambda abstractions – O Kiselyov - 1998
139 Type Systems for Programming Languages – J C Mitchell - 1990
18 Studying the fully abstract model of PCF within its continuous function model – A Jung, A Stoughton - 1993
24 Notes on Sconing and Relators – John C. Mitchell, Andre Scedrov - 1993
321 λµ-calculus: an algorithmic interpretation of classic natural deduction – M Parigot - 1992
845 A Formulation of the Simple Theory of Types – A Church - 1940
183 Introduction to Lambda Calculus – Henk Barendregt, Erik Barendsen - 1994
1115 The Lambda Calculus: Its Syntax and Semantics – H Barendregt - 1984
94 Inductive Types and Type Constraints in the Second-Order Lambda Calculus – N P Mendler - 1991