91 search results - page 13 / 19 » Inductive Beluga: Programming Proofs |
156
click to vote
KRDB
1996
15 years 5 months ago
1996
Metaprogramming adds new expressive power to logic programming which can be advantageous to transfer to the field of deductive databases. We propose metaprogramming as a way to mo...
129
click to vote
CADE
2001
Springer
16 years 4 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
139
click to vote
LICS
1994
IEEE
15 years 8 months ago
1994
IEEE
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
135
click to vote
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
132
click to vote
BIRTHDAY
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...