First-order unification by structural recursion

Journal of Functional Programming

Volumn 13, Issue 6, 2003, Pages 1061-1075

  McBride, Conor ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

STRUCTURAL RECURSION; UNIFICATION;

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA PROCESSING; DATA STRUCTURES; RECURSIVE FUNCTIONS; XML;

COMPUTER PROGRAMMING;

EID: 0242636422     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796803004957     Document Type: Article

References (22)

1. Augustsson, L. (1998) Cayenne - a language with dependent types. ACM International Conference on Functional Programming. ACM.
2. Bove, A. (1999) Programming in Martin-löf Type Theory. Unification: A non-trivial Example. Licentiate Thesis, Chalmers University of Technology, Sweden.
3. Burstall, R. (1969) Proving Properties of Programs by Structural Induction. Computer J. 12(1), 41-48.
4. Burstall, R. (1987) Inductively Defined Functions in Functional Programming Languages. J. Comput. Syst. Sci. 34, 409-421.
5. Coen, M. (1992) Interactive Program Derivation. PhD thesis, University of Cambridge.
6. Coquand, C. and Coquand, T. (1999) Structured Type Theory. Workshop on Logical Frameworks and Metalanguages.
7. Dybjer, P. (1994) Inductive families. Formal Aspects of Comput. 6, 440-465.
8. Dybjer, P. and Setzer, A. (1999) A finite axiomatization of inductive-recursive definitions. Proceedings of Typed Lambda Calculi and Applications: LNCS, pp. 129-146. Springer-Verlag.
9. Huet, G. (1997) The Zipper. J. Functional Program. 7(5), 549-554.
10. Jaume, M. (1997) Unification: a case study in transposition of formal properties. In: Gunter, E. L. and Felty, A., editors, Supplementary Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics: Poster session TPHOLs'97, pp. 79-93.
11. Luo, Z. (1994) Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press.
12. Luo, Z. and Pollack, R. (1992) LEGO Proof Development System: User's Manual. Technical report ECS-LFCS-92-211, Laboratory for Foundations of Computer Science, University of Edinburgh.
13. Magnusson, L. (1994) The implementation of ALF - A Proof Editor based on Martin-Löfs Monomorphic Type Theory with Explicit Substitutilon. PhD thesis, Chalmers University of Technology, Göteborg.
14. Manna, Z. and Waldinger, R. (1981) Deductive Synthesis of the Unification Algorithm. Sci. Comput. Program. 1, 5-48. North-Holland.
15. McBride, C. (1999) Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh.
16. McBride, C. (2003a) Proving First-Order Unification Correct. CUP website.
17. McBride, C. (2003b) LEGO development of First-Order Unification. CUP website.
18. Paulson, L. (1985) Verifying the Unification Algorithm in LCF. Sci. f Comput. Program. 5, 143-169.
19. Pfenning, F. and Paulin-Mohring, C. (1990) Inductively defined types in the calculus of constructions. In: Main, M., Melton, A., Mislove, M. and Schmidt, D., editors, Mathematical Foundations of Programming Semantics 1989: LNCS 442, pp. 209-228. Springer-Verlag.
20. Robinson, A. (1965) A Machine-oriented Logic Based on the Resolution Principle. J. ACM, 12, 23-41.
21. Rouyer, J. (1992) Développement de l'algorithme d'unification dans le Calcul des Constructions avecs types inductifs. Technical report 1795, INRIA-Lorraine.
22. Turner, D. (1995) Elementary strong functional programming. Functional Programming Languages in Education, First International Symposium: LNCS 1022. Springer-Verlag.