A polymorphic language which is typable and poly-step

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

Volumn 1538, Issue , 1998, Pages 43-60

  Roversi, Luca ^a  

^a AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE PROTOTYPING;

AFFINE LOGIC; FUNCTIONAL LANGUAGES; NORMAL FORM; TIME ALGORITHMS;

COMPUTATION THEORY;

EID: 84947945001     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49366-2_4     Document Type: Conference Paper

References (10)

1. [1] A. Asperti. Light Affine Logic. In Proceedings of Symposium on Logic in Computer Science LICS'98, 1998.
2. [2] L. Damas and R. Milner. Principal type-schemes for functional programs. In Proceedings of Symposium on Logic in Computer Science LICS'82, January 1982.
3. [3] J.-Y. Girard. Light Linear Logic. Information and Computation, 143:175-204, 1998.
4. [4] J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.
5. [5] C.A. Gunter. Semantics of Programming Languages: Structures and Techniques. Foundations of Computing. The MIT Press, 1992.
6. [6] M. Hoffmann. A mixed modal/linear lambda calculus with applications to Bellantoni-Cook safe recursion. In Proceedings of Computer Science Logic 1997 (CSL'97), Aarhus, Denmark, volume To appear, 1997.
7. [7] D. Leivant and J.-Y. Marion. Lambda calculus characterizations of poly-time. Fundamenta Informaticae, 19:167-184, 1993.
8. [8] R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. The MIT Press, 1990.
9. [9] G. Plotkin. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science, 1:125-159, 1975.
10. [10] L. Roversi. Concrete syntax for intuitionistic light affine logic with polymorphic type assignment. In Theoretical Computer Science: Proceedings of the Sixth Italian Conference (Prato). World Scientific (TO APPEAR), 9-11 November 1998.