Coercion synthesis in computer implementations of type-theoretic frameworks

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

Volumn 1512, Issue , 1998, Pages 9-27

  Bailey, Anthony ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPUTER IMPLEMENTATIONS; FORMALISATION; SYNTHESISED;

SYNTACTICS;

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

References (18)

1. P. Aczel. Galois: a theory development project. Representation of Mathematics in Logical Frameworks, Turin, 1993.
2. A. Bailey. LEGO with implicit coercions. Draft documenting an earlier version of LEGOwcs.
3. G. Baxthe. Implicit coercions in type systems. Proceedings of TYPES’95, Springer-Verlag, 1996.
4. G. Betarte, A. Tasistro. Extension of Martin-Löf ‘s theory of types with record types and subtyping. Two manuscripts, 1995.
5. V. Breazu-Tannen, T. Coquand, C. Gunter, A. Scedrov. Inheritance as Implicit Coercion. Information and Computation 93, July 1991.
6. B. Barras, S. Boutin, C. Comes, J. Courant, J. Fillaˆtre, E. Giménez, H. Herbelin, G. Huet, C. Muñoz, C. Murthy, C. Parent, C. Paulin-Mohring, A. Saïbi, B. Werner. The Coq proof assistant reference manual. INRIA-Rocquencourt and CNRS-ENS Lyon, 1996.
7. Th. Coquand, G. Huet. The calculus of constructions. Information and Computation 76, 1988.
8. W. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science 13, 1981.
9. A. Jones. Some algorithmic and proof-theoretical aspects of coercive subtyping. Informal Proceedings of TYPES’96 (Aussois), 1997.
10. Z. Luo. Computation and reasoning: a type theory for computer science. Oxford University Press, 1994.
11. Z. Luo. Coercive subtyping in type theory. Annual Conference of the European Association for Computer Science Logic, Utrecht, 1996.
12. Z. Luo, R. Pollack. The LEGO proof development system: user’s manual. Technical Report ECS-LFCS-92-211, LFCS, University of Edinburgh, 1992.
13. P. Martin-Löf. Intuitionistic type theory. Bibliopolis, 1984.
14. T. Nipkow. Higher-order unification, polymorphism, and subsorts. Proceedings of the Second International Workshop on Conditional and Typed Rewriting Systems, LNCS 516, 1990.
15. R. Pollack. Implicit syntax. Informal Proceedings of the First Workshop on Logical Frameworks (Antibes), 1990.
16. R. Pollack. How to believe a machine-checked proof, submitted to Twenty-Five Years of Constructive Type Theory: Proceedings of the Venice Meeting URL: ftp://ftp.des.ed.ac.uk/pub/lego/pollack-belief.ps.gz.
17. A. Saïbi. Typing algorithm in type theory with inheritance. 24th Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Paris, 1997.
18. B. Werner. Une théorie des constructions inductives. Doctoral thesis, Université Paris 7, 1994.