|
1
|
Applications of inductive definitions and choice principles to program synthesis
– Ulrich Berger, Monika Seisenberger
|
|
1
|
A constructive proof of Higman’s lemma
– Stefan Berghofer, Technische Universität München
- 1984
|
|
5
|
Higman's Lemma in Type Theory
– Daniel Fridlender
- 1997
|
|
|
A Proof-Theoretical Investigation of Zantema's Problem
– Thierry Coquand, Henrik Persson
- 1998
|
|
2
|
Extending Homeomorphic Embedding in the Context of Logic Programming
– Michael Leuschel
- 1997
|
|
|
Regularity for ω-Languages Based on Well-Quasi-Orders
– Mizuhito Ogawa
- 1997
|
|
3
|
An Inductive Version of Nash-Williams’ Minimal-BadSequence Argument for Higman’s Lemma
– Monika Seisenberger
- 2001
|
|
57
|
Homeomorphic Embedding for Online Termination
– Michael Leuschel
- 1998
|
|
4
|
Ramsey's Theorem in Type Theory
– Daniel Fridlender
- 1993
|
|
2
|
Integrated Development of Algebra in Type Theory
– Thierry Coquand, Henrik Persson
- 1998
|
|
5
|
Well-foundedness of the higher-order recursive path ordering in Coq
– Adam Koprowski
- 2004
|
|
1
|
Coq formalization of the higher-order recursive path ordering
– Adam Koprowski
|
|
|
Stop when you are Almost-Full Adventures in constructive termination
– Dimitrios Vytiniotis, Thierry Coquand
|
|
21
|
Type Theory and Programming
– Thierry Coquand , Bengt Nordström, Jan M. Smith, Björn von Sydow
- 1994
|
|
32
|
Reference Counting as a Computational Interpretation of Linear Logic
– Jawahar Chirimar, Carl A. Gunter, Jon G. Riecke
- 1996
|
|
3
|
Program Extraction in a Logical Framework Setting
– Penny Anderson
- 1994
|
|
57
|
The origins of structural operational semantics
– Gordon D. Plotkin
- 2004
|
|
|
Finitization Procedures and Finite Model Property.
– Jacques Riche
|
|
1
|
Infinite strings generated by insertions
– O. D. Golubitsky, S. Falconer
|
