Let-polymorphism and eager type schemes

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

Volumn 1214, Issue , 1997, Pages 490-501

  Liang, Chuck ^a  

^a FROSTBURG STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFERENCE ENGINES; POLYMORPHISM;

CLOSURE OPERATIONS; GOAL-DIRECTED PROOF; HIGHER-ORDER ABSTRACT SYNTAX; LOGICAL FRAMEWORKS; META LEVELS; POLYMORPHIC TYPES; TYPE INFERENCES; TYPE VARIABLES;

SOFTWARE DESIGN;

EID: 84957024385     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030621     Document Type: Conference Paper

References (18)

1. Andrew Appel and Zhong Shao. Smartest Recompilation. In Tenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 1993. Longer version as Princeton University Technical Report CS-TR-395-92.
2. Luis Damns and Robin Milner. Principal type-schemes for functional programs. In Ninth Annual ACM SIGPLAN-SIGA CT Symposium on Principles of Programming Languages, pages 207-212, January 1982.
3. Scott Dietzen and Frank Pfenning. A declarative alternative to assert in logic programming. In Proceedings of the 1991 International Logic Programming Symposium, pages 372-386. MIT Press, 1991.
4. G. Dowek et al. The Coq proof assistant user's guide. Technical Report 134, INRIA, 1993.
5. C. A. Gunter. Semantics of Programming Languages: Structures and Techniques. Foundations of Computing. MIT Press, 1992.
6. John Hannah. Extended natural semantics. Journal of Functional Programming, 3(2):123-152, April 1993.
7. Robert Harper. Systems of polymorphic type assignment in LF. Technical Report CMU-CS-90-144, Carnegie Mellon University, Pittsburgh, Pennsylvania, June 1990.
8. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143-184, 1993.
9. P. M. Hill and J. G. Gallagher. Meta-programming in logic programming. Technical Report Report 94.22, University of Leeds, hill@scs.leeds.ac.uk, August 1994. To appear in Vol. 5 of the Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press.
10. Trevor Jim. What are principal typings and what are they good for? Technical Report MIT/LCS TM-532, MIT, November 1995. Extended version of a paper appearing in A CM Symposium on Principles of Programming Languages, 1996.
11. Stefan Kaes. Type Inference in the presence of Overloading, Subtyping, and Recursive types. In 1992 ACM conference on LISP and Functional Programming, San Francisco, CA, pages 193-204. ACM Press, 1992.
12. Daniel Leivant. Polymorphie type inference. In Conference Record of the Tenth Annual A CM Symposium on Principles of Programming Languages, pages 88-98, 1983.
13. Chuck Liang. Substitution, Unification and Generalization in Meta-Logic. PhD thesis, University of Pennsylvania, September 1995.
14. Dale Miller. Abstractions in logic programming. In Piergiorgio Odifreddi, editor, Logic and Computer Science, pages 329-359. Academic Press, 1990.
15. Dale Miller. A logic programming language with lambda-abstraetion, function variables, and simple unification. Journal of Logic and Computation, 1(4):497-536, 1991.
16. Lawrence C. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5:363-397, September 1989.
17. Frank Pfenning and Conal Elliot. Higher-order abstract syntax. In Proceedings of the A CM-SIGPLAN Conference on Programming Language Design and Implementation, pages 199-208. ACM Press, June 1988.
18. Mitchell Wand. A simple algorithm and proof for type inference. Fundamenta Infomaticae, 10:115-122, 1987.