Infinitary Howe's Method

Electronic Notes in Theoretical Computer Science

Volumn 164, Issue 1, 2006, Pages 85-104

  Levy, Paul Blain ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

applicative bisimulation; call by value; coinductive; Howe's method; infinitary syntax; nondeterminism

Indexed keywords

APPLICATIVE BISIMULATION; CALL-BY-VALUE LANGUAGES; HOWE'S METHOD; INDUCTIVE/COINDUCTIVE ARGUMENT; INFINITARY SYNTAX; NONDETERMINISTIC LANGUAGES;

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; PROBLEM SOLVING;

COMPUTER SCIENCE;

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

References (14)

1. Abramsky S. The lazy λ-calculus. Research topics in Functional Programming (1990), Addison Wesley 65-117
2. Abramsky S. A domain equation for bisimulation. Information and Computation 92 (1991)
3. Altenkirch T., and Reus B. Monadic presentations of λ-terms using generalized inductive types. In: Flum J., and Rodríguez-Artalejo M. (Eds). Proc. of 13th Int. Workshop on Computer Sci. Logic, 1999. LNCS 1683 (1999), Springer
4. Fiore, M., G. D. Plotkin and D.Turi, Abstract syntax and variable binding, in: G. Longo, editor, Proceedings of the 14th Annual Symposium on Logic in Computer Science (LICS'99) (1999), pp. 193-202
5. Gordon A.D. Bisimilarity as a theory of functional programming. Theor. Comput. Sci. 228 (1999) 5-47
6. Howe, D. J., Equality in lazy computation systems, in: Proc. 4th IEEE Symposium on Logic in Computer Science, 1989, pp. 198-203
7. Howe D.J. Proving congruence of bisimulation in functional programming languages. Inf. and Comp. 124 (1996)
8. Lassen, S., "Relational Reasoning about Functions and Nondeterminism," Ph.D. thesis, Univ. of Aarhus (1998)
9. 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. LNCS 1672 (1999) 198-208
10. Matthes, and Uustalu. Substitution in non-wellfounded syntax with variable binding. TCS: Theoretical Computer Science 327 (2004)
11. Moran, A., "Natural Semantics for Non-Determinism," Master's thesis, Dept. of Computing Science, Chalmers University of Technology (1994)
12. Nygaard M., and Winskel G. HOPLA-A higher-order process language. Proc., 13th Intl. Conf. on Concurrency Theory. LNCS 2421 (2002)
13. Pitcher, C., "Functional Programming and Erratic Non-Determinism," Ph.D. thesis, Oxford Univ. (2001)
14. Pitts A.M. Operationally-based theories of program equivalence. In: Dybjer P., and Pitts A.M. (Eds). Semantics and Logics of Computation (1997), Cambridge University Press 241-298 Publications of the Newton Institute