First Order Logic With Domain Conditions (2001)

Cached

Download Links

by Freek Wiedijk , Jan Zwanenburg
Venue:in `Theorem Proving in Higher Order Logics, TPHOLs 2003', Vol. 2758 of LNCS
Citations:2 - 0 self

Documents Related by Co-Citation

232 The Formal Semantics of Programming Languages: An Introduction – G Winskel - 1993
7 Another Look at Nested Recursion – Konrad Slind
3 Recursive functions with higher order domains – Ana Bove, Venanzio Capretta - 2005
1 2002a) General Recursion in Type Theory, Ph.D. thesis, Chalmers University of Technology, Department of Computing Science. (Available at http://www.cs.chalmers.se/ ∼bove/Papers/phd thesis.ps.gz.) Modelling general recursion in type theory 707 – A Bove
1 Automatisierung der vollstandigen Induktion, Oldenbourgh Verlang – D Hutter - 1992
1 Springer-Verlag Lecture Notes in Computer Science 442. (Also – J C C Phillips - 1992
1 Méta-théorie du Calcul des – B Werner - 1994
21 Type Theory and Programming – Thierry Coquand , Bengt Nordström, Jan M. Smith, Björn von Sydow - 1994
3 Programming in Martin-Löf Type Theory Unification - A non-trivial Example – Ana Bove, Ana Bove - 1999
10 Partial functions in a total setting – Simon Finn, Mike Fourman, John Longley - 1997
14 Proving Termination of Normalization Functions for Conditional Expressions – Lawrence C Paulson - 1986
10 Computing Induction Axioms – CHRISTOPH WALTHER - 1992
14 Abstraction and Computation – Venanzio Capretta - 2002
66 A Categorical Programming Language – Tatsuya Hagino, Tatsuya Hagino - 1987
65 A General Formulation of Simultaneous Inductive-Recursive Definitions in Type Theory – Peter Dybjer - 1998
43 The automation of proof by mathematical induction – Alan Bundy - 1997
28 Termination Checking with Types – Andreas Abel - 1999
16 Fix-point Equations for Well-Founded Recursion in Type Theory – Antonia Balaa, Yves Bertot - 2000
43 Inductively Defined Types in the Calculus of Constructions – Frank Pfenning, Christine Paulin-Mohring - 1989