|
56
|
A General Formulation of Simultaneous Inductive-Recursive Definitions in Type Theory
– Peter Dybjer
- 1998
|
|
22
|
Nested General Recursion and Partiality in Type Theory
– Ana Bove, Venanzio Capretta
- 2000
|
|
8
|
Treating partiality in a logic of total functions
– Olaf Müller, Konrad Slind
- 1997
|
|
10
|
Partial functions in a total setting
– Simon Finn, Mike Fourman, John Longley
- 1997
|
|
4
|
Inductive invariants for nested recursion
– Sava Krstić, John Matthews
- 2003
|
|
26
|
Reasoning about terminating functional programs
– K Slind
- 1999
|
|
585
|
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
– T Nipkow, L C Paulson, M Wenzel
- 2002
|
|
13
|
Abstraction and Computation
– V Capretta
- 2002
|
|
4
|
Type-theoretic functional semantics
– Yves Bertot, Venanzio Capretta, Kuntal Das Barman
- 2002
|
|
8
|
Fonctions récursives générales par itération en théorie des types
– A Balaa, Y Bertot
- 2002
|
|
14
|
Proving Termination of Normalization Functions for Conditional Expressions
– Lawrence C Paulson
- 1986
|
|
202
|
The Formal Semantics of Programming Languages: An Introduction
– G Winskel
- 1993
|
|
158
|
An introduction to inductive definitions
– P Aczel
- 1977
|
|
6
|
Substitution and refutation revisited
– H-P Ko, M E Nadel
- 1991
|
|
417
|
The calculus of constructions
– Coquand, G Huet
- 1988
|
|
1
|
How widely applicable is Coq? Contribution to the Coq mailing list, 19 Aug 2002, http://pauillac.inria.fr/bin/ wilma hiliter/coq-club/200208/msg00003.html
– Christine Paulin
|
|
3
|
Coinduction in Coq
– Yves Bertot
- 2005
|
|
6
|
Generalized Coiteration Schemata
– Daniela Cancila, Furio Honsell, Marina Lenisa
- 2003
|
|
15
|
Generalised Coinduction
– Falk Bartels
- 2001
|
