Head normal form bisimulation for pairs and the λμ- calculus

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 297-306

  Lassen, Soren B ^a  

^a GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BISIMILARITY; BISIMULATION EQUIVALENCE; CO-INDUCTIVE REFORMULATION;

AUTOMATA THEORY; EQUIVALENCE CLASSES; FORMAL LOGIC; PROBLEM SOLVING;

DIFFERENTIATION (CALCULUS);

EID: 34547357338     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2006.29     Document Type: Conference Paper

References (22)

1. S. Abramsky. The lazy lambda calculus. In D. Turner, editor, Research Topics in Functional Programming, pages 65-116. Addison-Wesley, 1990.
2. H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. Number 103 in Studies in Logic and the Foundations of Mathematics. North-Holland, revised edition, 1984.
3. C. Böhm. Alcune proprieta delle forme βη-normali nel λK-calculus. Pubblicazioni 696, Instituto per le Applicazioni del Calcolo, Roma, 1968.
4. G. Boudol. On the semantics of the call-by-name CPS transform. Theoretical Computer Science, 234:309-321, 2000.
5. R. David. Computing with Böhm trees. Fundamenta Informaticae, 45:53-77, 2001.
6. R. David and W. Py. λμ-calculus and Böhm's theorem. Journal of Symbolic Logic, 66(1):407-413, 2001.
7. K. Fujita. A sound and complete CPS-translation for λμ;- calculus. In TLCA, volume 2701 of Lecture Notes in Computer Science, pages 120-134. Springer-Verlag, 2003.
8. J. Hatcliff and O. Danvy. Thunks and the λ-calculus. Journal of Functional Programming, 7(3):303-319, 1997.
9. M. Hofmann and T. Streicher. Continuation models are universal for λμ-calculus. In Proc. 12th Annual IEEE Symposium on Logic in Computer Science, pages 387-395, 1997.
10. D. J. Howe. Proving congruence of bisimulation in functional programming languages. Information and Computation, 124(2):103-112, 1996.
11. J. M. E. Hyland. A syntactic characterisation of the equality in some models for the lambda calculus. Journal of the London Mathematical Society, 12(3):361-370, 1976.
12. S. B. Lassen. Bisimulation in untyped lambda calculus: Böhm trees and bisimulation up to context. In MFPS XV, volume 20 of Electronic Notes in Theoretical Computer Science, pages 346-374. Elsevier, 1999.
13. S. B. Lassen. Eager normal form bisimulation. In Proc. 20th Annual IEEE Symposium on Logic in Computer Science, pages 345-354, 2005.
14. S. B. Lassen. Normal form simulation for McCarthy's amb. In MFPS XXI, volume 155 of Electronic Notes in Theoretical Computer Science, pages 445-465. Elsevier, 2005.
15. C-H. L. Ong and C. A. Stewart. A curry-howard foundation for functional computation with control. In Proc. 24th ACM Symposium on Principles of Programming Languages, 1997.
16. M. Parigot. λμ-calculus: An algorithmic interpretation of classical natural deduction. In A. Voronkov, editor, Proceedings Intl. Conf. on Logic Programming and Automated Reasoning, LPAR'92, St Petersburg, volume 624 of Lecture Notes in Computer Science, pages 190-201. Springer-Verlag, 1992.
17. G. D. Plotkin. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science, 1:125-159, 1975.
18. G. E. Révész. Categorical combinators with explicit products. Fundamenta Informaticae, 22:153-166, 1995.
19. D. Sangiorgi. The lazy lambda calculus in a concurrency scenario. Information and Computation, 111(1):120-153, 1994.
20. A. Saurin. Separation with streams in the λμ-calculus. In Proc. 20th Annual IEEE Symposium on Logic in Computer Science, pages 356-365, 2005.
21. K. Støvring. Extending the extensional lambda calculus with surjective pairing is conservative. Logical Methods in Computer Science, 2(2:1):1-14, 2006.
22. ∞ -models of the lambda-calculus. SIAM Journal on Computing, 5(3):488-521, 1976.