Computational lambda-calculus and monads (1989)

by Eugenio Moggi
Citations:437 - 6 self

Active Bibliography

730 Notions of Computation and Monads – Eugenio Moggi - 1991
14 Fixed Points and Extensionality in Typed Functional Programming Languages – Brian T. Howard - 1992
19 A Uniform Approach to Domain Theory in Realizability Models – John R. Longley, Alex K. Simpson - 1996
24 Deliverables: A Categorical Approach to Program Development in Type Theory – James Hugh McKinna - 1992
2 Should a function continue? – Jon Gary Riecke - 1989
7 Partial computations in constructive type theory – Scott F. Smith - 1991
17 An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory – Marcelo Fiore, Gordon D. Plotkin - 1997
7 Recursive Types in Kleisli Categories – Alex K. Simpson - 1992
7 Enrichment and Representation Theorems for Categories of Domains and Continuous Functions – Marcelo P. Fiore - 1996
Presheaf models of quantum computation: an – Octavio Malherbe, Philip Scott, Peter Selinger - 1302
3 Towards Hilbert's 24th Problem: Combinatorial Proof Invariants – Dominic J. D. Hughes - 2006
8 Combining algebraic effects with continuations – Martin Hyland, Paul Blain Levy , Gordon Plotkin , John Power - 2007
11 First Order Linear Logic in Symmetric Monoidal Closed Categories – Simon John Ambler - 1991
1 The Convex Powerdomain in a Category of Posets Realized By Cpos – Alex K. Simpson - 1995
8 Call-By-Push-Value: Decomposing Call-By-Value And Call-By-Name – Paul Blain Levy
19 Quantum categories, star autonomy, and quantum groupoids – Brian Day, Ross Street - 2004
62 Models of Sharing Graphs: A Categorical Semantics of let and letrec – Masahito Hasegawa - 1997
3 Linear realizability and full completeness for typed lambda calculi – Samson Abramsky, Marina Lenisa - 2005
M-LISP: Its Natural Semantics and Equational Logic (Extended Abtract) – Robert Muller - 1991