Type-theoretic functional semantics

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

Volumn 2410, Issue , 2002, Pages 83-97

  Bertot, Yves ^a   Capretta, Venanzio ^a   das Barman, Kuntal ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FORMAL LANGUAGES; FORMAL LOGIC; SEMANTICS; THEOREM PROVING;

DEFINITION DOMAIN; DENOTATIONAL SEMANTICS; FUNCTIONAL SEMANTICS; IMPERATIVE LANGUAGES; INFERENCE RULES; NESTED RECURSION; OPERATIONAL SEMANTICS; RECURSIVE DEFINITIONS;

RECURSIVE FUNCTIONS;

EID: 84945307605     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45685-6_7     Document Type: Conference Paper

References (15)

1. Antonia Balaa and Yves Bertot. Fix-point equations for well-founded recursion in type theory. In Harrison and Aagaard [8], pages 1-16.
2. Yves Bertot and Ranan Fraer. Reasoning with executable specifications. In International Joint Conference of Theory and Practice of Software Development (TAP-SOFT/FASE'95), volume 915 of LNCS. Springer-Verlag, 1995.
3. A. Bove. Simple general recursion in type theory. Nordic Journal of Computing, 8(1):22-42, Spring 2001.
4. Ana Bove and Venanzio Capretta. Nested general recursion and partialityin type theory. In Richard J. Boulton and Paul B. Jackson, editors, Theorem Proving in Higher Order Logics: 14th International Conference, TPHOLs 2001, volume 2152 of Lecture Notes in Computer Science, pages 121-135. Springer-Verlag, 2001.
5. Catherine Dubois and Veronique Viguie Donzeau-Gouge. A step towards the mechanization of partial functions: Domains as inductive predicates. Presented at CADE-15, Workshop on Mechanization of Partial Functions, 1998.
6. Peter Dybjer. A general formulation of simultaneous inductive-recursive definitions in type theory. Journal of Symbolic Logic, 65(2), June 2000.
7. Simon Finn, Michael Fourman, and John Longley. Partial functions in a total setting. Journal of Automated Reasoning, 18(1):85-104, February 1997.
8. J. Harrison and M. Aagaard, editors. Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000, volume 1869 of Lecture Notes in Computer Science. Springer-Verlag, 2000.
9. Tobias Nipkow. Winskel is (almost) right: Towards a mechanized semantics textbook. In V. Chandru and V. Vinay, editors, Foundations of Software Technology and Theoretical Computer Science, volume 1180 of LNCS, pages 180-192. Springer, 1996.
10. Christine Paulin-Mohring and Benjamin Werner. Synthesis of ML programs in the system Coq. Journal of Symbolic Computation, 15:607-640, 1993.
11. Lawrence C. Paulson. Proving termination of normalization functions for conditional expressions. Journal ofAutomated Reasoning, 2:63-74, 1986.
12. The Coq Development Team. LogiCal Project. The Coq ProofAssistant. Reference Manual. Version 7.2. INRIA, 2001.
13. K. Slind. Another look at nested recursion. In Harrison and Aagaard [8], pages 498-518.
14. Freek Wiedijk and Jan Zwanenburg. First order logic with domain conditions. Available at http://www.cs.kun.nl/~freek/notes/partial.ps.gz, 2002.
15. Glynn Winskel. The Formal Semantics of Programming Languages, an introduction. Foundations of Computing. The MIT Press, 1993.