Parallel reduction in type free λμ-calculus

Electronic Notes in Theoretical Computer Science

Volumn 42, Issue , 2001, Pages 52-66

  Baba, Kensuke ^a   Hirokawa, Sachio ^a   Fujita, Ken Etsu ^b  

^a KYUSHU UNIVERSITY   (Japan)

^b SHIMANE UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; LINEAR ALGEBRA; MATHEMATICAL OPERATORS;

DIAMOND PROPERTY; FUNCTIONAL PROGRAMMING LANGUAGES; REDUCTION SYSTEMS; STRUCTURAL REDUCTION;

COMPUTATION THEORY;

EID: 18944407167     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80878-8     Document Type: Conference Paper

References (20)

1. Akama Y. On Mints's Reduction for CCC-Calculus. Lecture Notes in Computer Science 664:1993;1-15
2. Barendregt H.P. "The Lambda Calculus," 2nd ed. :1984;North-Holland, Amsterdam
3. Bierman, G. M.: A Computational Interpretation of the λμ-Calculus, University of Cambridge Computer Laboratory Technical Report 448 (1998).
4. Felleisen M., Friedman D.P., Kohlbecker E., Duba B. A Syntactic Theory of Sequential Control. Theoretical Computer Science 52:1987;205-237
5. Fujita K. Calculus of Classical Proofs I. Lecture Notes in Computer Science 1345:1997;321-335
6. Fujita K. Explicitly Typed λμ-Calculus for Polymorphism and Call-by-Value. Lecture Notes in Computer Science 1581:1999;162-176
7. Fujita K.: Domain-Free λμ-Calculus, Informatique Théorique et Applications, forthcoming.
8. Griffin T.: A Formulae-as-Types Notion of Control, Conference Record of 17th ACM Symposium on Principles of Programming Languages (1990), 47-58.
9. de Groote Ph. On the Relation between the λμ-Calculus and the Syntactic Theory of Sequential Control. Lecture Notes in Computer Science 822:1994;31-43
10. de Groote, Ph.: An environment machine for the λμ-Calculus, Mathematical Structures in Computer Science, to appear.
11. Hindley J.R. "Basic Simple Type Theory" 1997;Cambridge University Press
12. Hindley J.R., Seldin J.P. "Introduction to Combinators and λ-Calculus" 1986;Cambridge University Press
13. Jay, C. B. and N. Ghani: The Virtues of Eta-expansion, LFCS report ECS-LFCS-92-243 (1992).
14. Ong C. -H. L. and C. A. Stewart: A Curry-Howard Foundation for Functional Computation with Control, Proc. 24th Annual ACM SIGPLAN-SIGACT Symposium of Principles of Programming Languages (1997).
15. Parigot M. λμ-Calculus: An Algorithmic Interpretation of Classical Natural Deduction. Lecture Notes in Artificial Intelligence 624:1992;190-201
16. Parigot M.: Strong Normalization for Second Order Classical Natural Deduction, Proc. 8th Annual IEEE Symposium on Logic in Computer Science (1993), 39-46.
17. Parigot M. Proofs of Strong Normalization for Second Order Classical Natural Deduction. J. Symbolic Logic. 62:(4):1997;1461-1479
18. van Raamsdonk F. Confluence and Superdevelopment. Lecture Notes in Computer Science 690:1993;168-182
19. Selinger P.: Implementation of the Call-By-Name λμv-Calculus, manuscript.
20. Takahashi M. Parallel Reductions in λ-Calculus. Information and Computation 118:1995;120-127