718 search results - page 25 / 144 » Extraction of Structured Programs from Specification Proofs |
96
Voted
CSL
2007
Springer
15 years 8 months ago
2007
Springer
We show how to extract classical programs expressed in Krivine λc-calculus from proof-terms built in a proof-irrelevant and classical version of the calculus of constructions with...
147
click to vote
ANLP
1992
15 years 3 months ago
1992
While complete understanding of arbitrary input text remains in the future, it is currently possible to construct natural language processing systems that provide a partial unders...
225
click to vote
CADE
2011
Springer
14 years 2 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
119
click to vote
ER
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we demonstrate an automatic approach for emergent semantics modeling of ontologies. We follow the collaborative ontology construction method without the direct intera...
230
Voted
ICFP
2009
ACM
16 years 3 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...