12774 search results - page 41 / 2555 » A Framework for Proof Systems |
134
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
104
click to vote
FOSSACS
2001
Springer
15 years 8 months ago
2001
Springer
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...
166
Voted
TLCA
1997
Springer
15 years 8 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
147
Voted
ENTCS
2008
15 years 3 months ago
2008
In this paper, we describe a proof-theoretic foundation for bottom-up logic programming based on uniform proofs in the setting of the logical framework LF. We present a forward un...
127
click to vote
LICS
1989
IEEE
15 years 7 months ago
1989
IEEE
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...