Categorical Completeness Results for the Simply-Typed Lambda-Calculus (1995)

Cached

Download Links

by Alex K. Simpson
Venue:Proceedings of TLCA '95, Springer LNCS 902
Citations:9 - 0 self

Active Bibliography

734 Notions of Computation and Monads – Eugenio Moggi - 1991
680 The Esterel Synchronous Programming Language: Design, Semantics, Implementation – Gerard Berry, Georges Gonthier, Ard Berry Georges Gonthier, Place Sophie Laltte - 1992
548 A Syntactic Approach to Type Soundness – Andrew K. Wright, Matthias Felleisen - 1992
751 Inductive-Data-Type Systems – Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada - 2002
445 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
459 Comprehending Monads – Philip Wadler - 1992
423 The Foundation of a Generic Theorem Prover – Lawrence C. Paulson - 1989
391 Explicit substitutions – M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy - 1996
26 A New Characterization of Lambda Definability – Achim Jung, Jerzy Tiuryn - 1993