Unique Fixed Point Induction for McCarthy's Amb (1999)

Cached

Download Links

by Søren Lassen , Andrew Moran
Venue:IN: PROCEEDINGS OF THE 24TH INTERNATIONAL SYMPOSIUM ON MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE, ”LNCS” 1672
Citations:7 - 2 self

Documents Related by Co-Citation

205 A Basis for a Mathematical Theory of Computation – John Mccarthy - 1963
31 Relational Reasoning about Functions and Nondeterminism – Søren Bøgh Lassen, Søren Bøgh Lassen - 1998
4 Normal Form Simulation for McCarthy’s amb – Søren Lassen - 2005
109 Proving congruence of bisimulation in functional programming languages – Douglas J. Howe - 1996
41 Divergence and Fair Testing – V. Natarajan, Rance Cleaveland - 1995
29 Call-by-Push-Value. A Functional/Imperative Synthesis – P B Levy - 2004
3 The lazy λ-calculus, in: Research topics – S Abramsky - 1990
121 Bisimilarity as a theory of functional programming – A D Gordon
4 Functional Programming and Erratic Non-Determinism – C Pitcher - 2001
6 Infinitary Howe’s method – Paul Blain Levy - 2006
38 Purely Functional Operating Systems – P Henderson - 1982
3 prepared by – Domains - 1983
3 Normal form simulation for McCarty’s amb – S B Lassen - 2005
17 The expressive power of indeterminate dataflow primitives – Prakash Panangaden, Vasant Shanbhogue - 1992
2 Natural Semantics for Non-Determinism – Andrew Moran - 1993
1 Monadic presentations of λ-terms using generalized inductive types – T Altenkirch, B Reus - 1999
12 HOPLA—a higher-order process language – Mikkel Nygaard, Glynn Winskel - 2002
6 and Tarmo Uustalu, Substitution in non-wellfounded syntax with variable binding, Theor – Ralph Matthes
95 Equality In Lazy Computation Systems – Douglas J. Howe - 1998