13383 search results - page 296 / 2677 » Abstractions from proofs |
188
click to vote
HOA
1995
15 years 10 months ago
1995
We show that it is decidable whether a third-order matching problem in the polymorphic lambda calculus has a solution. The proof is constructive in the sense that an algorithm can...
149
click to vote
TAPSOFT
1987
Springer
15 years 10 months ago
1987
Springer
The Calculus of Constructions is a higher-order formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn [2, 3], Girard [12], Martin...
180
click to vote
FLAIRS
2000
15 years 8 months ago
2000
The paper presents a survey of the VSE system, a kind of CASE-tool for formal software development. It is a summary of a tutorial presentation describing methodology, formalisms, ...
183
click to vote
AAAI
1990
15 years 7 months ago
1990
An equational approach to the synthesis of functional and logic programs is taken. Typically, a target program contains equations that are only true in the standard model of the g...
165
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
We describe the formalisation of the normal forms of context-free grammars (CFGs) using the HOL4 theorem prover. These straightforward pen and paper proofs easily understood from t...