Normal Form Simulation for McCarthy's Amb

Electronic Notes in Theoretical Computer Science

Volumn 155, Issue 1 SPEC. ISS., 2006, Pages 445-465

  Lassen, Soren B ^a  

^a GOOGLE INC   (United States)

Author keywords

calculus; ambiguous choice; co induction

Indexed keywords

COMPUTER PROGRAMMING; NUMERICAL ANALYSIS; THEOREM PROVING; TREES (MATHEMATICS);

AMBIGUOUS CHOICE; CO-INDUCTIONS; CO-INDUCTIVE OPERATIONAL THEORIES; LAMBDA CALCULUS;

COMPUTER SIMULATION;

EID: 33646263840     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.11.068     Document Type: Article

References (22)

1. Abramsky S. The lazy lambda calculus. In: Turner D. (Ed). Research Topics in Functional Programming (1990), Addison-Wesley 65-116
2. Carayol A., Hirschkoff D., and Sangiorgi D. On the representations of McCarthy's amb in the π-calculus. EXPRESS'03. Electronic Notes in Theoretical Computer Science 96 (2004) 73-89
3. Du Bois, A.R., R.F. Pointon, H.-W. Loidl and P.W. Trinder, Implementing declarative parallel bottom-avoiding choice, in: 14th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'02) (2002), pp. 82-92
4. Howe D.J. Proving congruence of bisimulation in functional programming languages. Information and Computation 124 (1996) 103-112
5. Hughes, J. and J. O'Donnell, Expressing and reasoning about non-deterministic functional programs, in: Proceedings of the Glasgow Functional Programming Workshop '89, Workshops in Computing (1990), pp. 308-328
6. Lassen S.B. Relational reasoning about contexts. In: Gordon A.D., and Pitts A.M. (Eds). Higher Order Operational Techniques in Semantics (1998), Publications of the Newton Institute, Cambridge University Press 91-135
7. Lassen, S.B., "Relational Reasoning about Functions and Nondeterminism," Ph.D. thesis, Department of Computer Science, University of Aarhus (1998), BRICS Dissertation Series DS-98-2
8. Lassen S.B. Bisimulation in untyped lambda calculus: Böhm trees and bisimulation up to context. MFPS XV. Electronic Notes in Theoretical Computer Science 20 (1999) 346-374
9. Lassen, S.B., Eager normal form bisimulation, in: Proc. 20th Annual IEEE Symposium on Logic in Computer Science, 2005, pp. 345-354
10. Lassen, S.B., P.B. Levy and P. Panangaden, Divergence-least semantics of amb is Hoare (2005), short presentation at the APPSEM II workshop, September 2005, Frauenchiemsee, Germany
11. Lassen S.B., and Moran A.K. Unique fixed point induction for McCarthy's amb. Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science 1672 (1999) 198-208
12. Lassen S.B., and Pitcher C.S. Similarity and bisimilarity for countable non-determinism and higher-order functions (extended abstract). Second Workshop on Higher-Order Operational Techniques in Semantics. (HOOTS II). Electronic Notes in Theoretical Computer Science 10 (1998) 246-266
13. McCarthy J. A basis for a mathematical theory of computation. Computer Programming and Formal Systems (1963), North-Holland, Amsterdam 33-70
14. Moran, A.K., "Call-by-name, Call-by-need, and McCarthy's Amb," Ph.D. thesis, Department of Computing Science, Chalmers University of Technology and University of Gothenburg (1998)
15. Ong C.-H.L. Lazy lambda calculus: Theories, models and local structure characterization. 19th ICALP. Lecture Notes in Computer Science 623 (1992) 487-498
16. Ong, C.-H.L., Non-determinism in a functional setting, in: Proc. 8th Annual IEEE Symposium on Logic in Computer Science, Montreal, 1993, pp. 275-286
17. Panangaden P. McCarthy's amb cannot implement fair merge. Proc. 8th FST&TCS Conference. Lecture Notes in Computer Science 338 (1988) 348-363
18. Panangaden P., and Shanbhogue V. The expressive power of indeterminate dataflow primitives. Information and Computation 98 (1992) 99-131
19. Panangaden P., and Stark E.W. Computations, residuals, and the power of indeterminancy. 15th ICALP. Lecture Notes in Computer Science 317 (1988) 439-454
20. Park D. The fairness problem and nondeterministic computing networks. Foundations of Computer Science IV. Mathematical Centre Tracts 159 (1983) 133-161
21. Sangiorgi D. The lazy lambda calculus in a concurrency scenario. Information and Computation 111 (1994) 120-153
22. Søndergaard H., and Sestoft P. Non-determinism in functional languages. Computer Journal 35 (1992) 514-523