Curry-style types for nominal terms

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

Volumn 4502 LNCS, Issue , 2007, Pages 125-139

  Fernández, Maribel ^a   Gabbay, Murdoch J ^b  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

Binding; Polymorphism; Rewriting; Type inference

Indexed keywords

COMPUTATIONAL METHODS; POLYMORPHISM; PROBLEM SOLVING; RANDOM VARIABLES;

POLYMORPHIC TYPE SYSTEMS; REWRITING; TYPE INFERENCE;

THEOREM PROVING;

EID: 38049177793     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74464-1_9     Document Type: Conference Paper

References (21)

1. Baader, F., Snyder, W.: Unification Theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, ch. 8, pp. 445-532. Elsevier Science, Amsterdam (2001)
2. van Bakel, S., Fernández, M.: Normalization results for typable rewrite systems. Information and Computation 133(2), 73-116 (1997)
3. Barbanera, F., Fernández, M.: Intersection type assignment systems with higher-order algebraic rewriting. Theoretical Computer Science 170, 173-207 (1996)
4. Barendregt, H.P.: Pairing without conventional constraints. Zeitschrift für mathematischen Logik und Grundlagen der Mathematik 20, 289-306 (1974)
5. Barendregt, H.P.: Lambda Calculi With Types. In: Abramsky, S., Gabbay, D., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, Oxford University Press, Oxford (1992)
6. Barendregt, H.P., Coppo, M., Dezani-Ciancaglini, M.: A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic 48(4), 931-940 (1983)
7. Berghofer, S., Urban, C.: A Head-to-Head Comparison of de Bruijn Indices and Names. In: LFMTP'06, pp. 46-59 (2006)
8. Curry, H.B., Feys, R.: Combinatory Logic, vol. 1. North-Holland, Amsterdam (1958)
9. Damas, L.M.M., Milner, R.: Principal Type Schemes for Functional programs. In: Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, ACM Press, New York (1982)
10. Fernández, M., Gabbay, M.J., Mackie, I.: Nominal Rewriting Systems. In: PPDP'04. ACM Symposium on Principles and Practice of Declarative Programming, ACM Press, New York (2004)
11. Fernández, M., Gabbay, M.J.: Nominal Rewriting with Name Generation: Abstraction vs. Locality. In: PPDP'05. ACM Symposium on Principles and Practice of Declarative Programming, ACM Press, New York (2005)
12. Fernández, M., Gabbay, M.J.: Nominal Rewriting. Information and Computation (to appear), available from http://dx.doi.org/10.1016/j.ic.2006.12. 002
13. Gabbay, M.J., Pitts, A.M.: A New Approach to Abstract Syntax with Variable Binding. Formal Aspects of Computing 13, 341-363 (2002)
14. Gabbay, M.J.: A Theory of Inductive Definitions with Alpha-Equivalence. PhD Thesis, Cambridge University (2000)
15. Girard, J.-Y.: The System F of Variable Types, Fifteen Years Later, Theoretical Computer Science, 45 (1986)
16. Gosling, J., Joy, B., Steele, G.: The Java Language Specification. Addison-Wesley, Reading (1996)
17. Khasidashvili, Z.: Expression reduction systems. In: Tbisili. Proceedings of I.Vekua Institute of Applied Mathematics, vol. 36, pp. 200-220 (1990)
18. Klop, J.-W., van Oostrom, V., van Raamsdonk, F.: Combinatory reduction systems, introduction and survey. Theoretical Computer Science 121, 279-308 (1993)
19. Mayr, R., Nipkow, T.: Higher-order rewrite systems and their confluence. Theoretical Computer Science 192, 3-29 (1998)
20. Shinwell, M.R., Pitts, A.M., Gabbay, M.: FreshML: Programming with binders made simple. In: ICFP 2003, pp. 263-274 (2003)
21. Urban, C., Pitts, A.M., Gabbay, M.J.: Nominal unification. Theoretical Computer Science 323, 473-497 (2004)