Direct Models of the Computational Lambda-calculus
Author:
- Carsten FührmannCFCarsten Führmann
Open Access
- 31 December 1999
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 20, 245-292
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Equational Lifting MonadsElectronic Notes in Theoretical Computer Science, 1999
- Models of Sharing Graphs1999
- Premonoidal categories and flow graphsElectronic Notes in Theoretical Computer Science, 1998
- A representable approach to finite nondeterminismTheoretical Computer Science, 1997
- Premonoidal categories and notions of computationMathematical Structures in Computer Science, 1997
- Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda calculi1997
- Environments, continuation semantics and indexed categories1997
- Semantics of weakening and contractionAnnals of Pure and Applied Logic, 1994
- Notions of computation and monadsInformation and Computation, 1991
- Categories for the Working Mathematician1971