1894 search results - page 86 / 379 » A TLA Proof System |
113
click to vote
LPAR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
103
Voted
ENTCS
2007
15 years 21 days ago
2007
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
105
click to vote
AI
2000
Springer
15 years 18 days ago
2000
Springer
We investigate the improvement of theorem proving by reusing previously computed proofs. We have developed and implemented the PLAGIATOR system which proves theorems by mathematic...
91
Voted
CADE
1990
Springer
15 years 4 months ago
1990
Springer
In automated deduction systems that are intended for human use, the presentation of a proof is no less important than its discovery. For most of today's automated theorem pro...
112
Voted
ITP
2010
15 years 4 months ago
2010
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...