Sciweavers

6274 search results - page 16 / 1255
» Proofs, Programs, Processes
Sort
View
ACL2
2006
ACM
14 years 1 months ago
Soundness of the simply typed lambda calculus in ACL2
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
Sol Swords, William R. Cook
MPC
1995
Springer
125views Mathematics» more  MPC 1995»
13 years 11 months ago
Synthesizing Proofs from Programs in the Calculus of Inductive Constructions
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
Catherine Parent
JFP
2010
82views more  JFP 2010»
13 years 6 months ago
Formal polytypic programs and proofs
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
Wendy Verbruggen, Edsko de Vries, Arthur Hughes
LOPSTR
2004
Springer
14 years 1 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
ENTCS
2006
113views more  ENTCS 2006»
13 years 7 months ago
A Large-Scale Experiment in Executing Extracted Programs
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
Luís Cruz-Filipe, Pierre Letouzey