111 search results - page 14 / 23 » A Proof of Strong Normalisation using Domain Theory |
PLDI
2010
ACM
14 years 19 days ago
2010
ACM
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
TC
2010
13 years 6 months ago
2010
—Reliability analysis has become a tool of fundamental importance to virtually all electrical and computer engineers because of the extensive usage of hardware systems in safety ...
ICFP
2008
ACM
14 years 8 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
AML
2007
13 years 8 months ago
2007
A method is described for obtaining conjunctive normal forms for logics using Gentzen-style rules possessing a special kind of strong invertibility. This method is then applied to ...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...