Unique fixed point induction for McCarthy’s amb

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1672, Issue , 1999, Pages 198-208

  Lassen, Søren B ^a   Moran, Andrew ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

CONTEXTUAL EQUIVALENCE; FIXED POINT PRINCIPLES; HIGHER ORDER FUNCTIONS; NATURAL SEMANTICS; NON DETERMINISM; OPERATIONAL METHODS; PARALLEL EVALUATION; REASONING METHODS;

FUNCTIONAL PROGRAMMING;

EID: 84880207854     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48340-3_18     Document Type: Conference Paper

References (22)

1. K. R. Apt and G. D. Plotkin. Countable nondeterminism and random assignment. Journal of the ACM, 33(4):724-767, 1986.
2. S. Arun-Kumar and M. Hennessy. An efficiency preorder for processes. In TACS '91, LNCS 526. Springer, 1991.
3. M. Broy. A theory for nondeterminism, parallelism, communication, and concurrency. Theoretical Computer Science, 45(1):1-61, 1986.
4. A. D. Gordon. Functional Programming and Input/Output. Distinguished Dissertations in Computer Science. Cambridge U. P., 1994.
5. A. D. Gordon. Bisimilaxity as a theory of functional programming. In MFPS XI, ENTCS 1. Elsevier, 1995.
6. A. D. Gordon and A. M. Pitts, editors. Higher Order Operational Techniques in Semantics. Publications of the Newton Institute. Cambridge U. P., 1998.
7. D. Howe. Proving congruence of bisimulation in functional programming. Information and Computation, 124(2):103-112, 1996.
8. J. Hughes and J. T. O'Donnell. Expressing and reasoning about non-deterministic functional programs. In Functional Programming, Glasgow, 1989, Workshops in Computing. Springer, 1989.
9. S. B. Lassen. Relational reasoning about contexts. In Gordon and Pitts [6], pages 91-135.
10. S. B. Lassen. Relational Reasoning about Functions and Nondeterminism. PhD thesis, Dept, of Computer Science, University of Aarhus, May 1998.
11. S. B. Lassen and C. S. Pitcher. Similarity and bisimilarity for countable nondeterminism and higher-order functions. In HOOTS II, ENTCS 10. Elsevier, 1998.
12. J. McCarthy. A basis for a mathematical theory of computation. In Computer Programming and Formal Systems, pages 33-70. North-Holland, 1963.
13. A. K. Moran. Call-by-name, Call-by-need, and McCarthy's Amb. PhD thesis, Dept, of Computer Science, Chalmers University of Technology, Sept. 1998.
14. A. K. Moran and D. Sands. Improvement in a lazy context: An operational theory for call-by-need. In POPL '99. ACM, 1999.
15. A. K. Moran, D. Sands, and M. Carlsson. Erratic Fudgets: A semantic theory for an embedded coordination language. In Coordination '99, LNCS 1594. Springer, 1999.
16. Y. N. Moschovakis. A game-theoretic, concurrent and fair model of the typed lambda-calculus, with full recursion. In CSL '97, LNCS 1414. Springer, 1998.
17. C.-H. L. Ong. Non-determinism in a functional setting. In LICS '93. IEEE, 1993.
18. D. Sands. Improvement theory and its applications. In Gordon and Pitts [6], pages 275-306.
19. D. Sangiorgi. On the bisimulation proof method. In MFCS '95, LNCS 969, pages 479-488. Springer, 1995.
20. D. Sangiorgi and R. Milner. The problem of "weak bisimulation up to". In CONCUR '92, LNCS 789. Springer, 1992.
21. H. Søndergaard and P. Sestoft. Non-determinism in functional languages. The Computer Journal, 35(5):514-523, 1992.
22. P. Wadler. Comprehending monads. Mathematical Structures in Computer Science, 2:461-493, 1992.