213 search results - page 11 / 43 » A framework for checking proofs naturally |
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
TPHOL
2008
IEEE
14 years 1 months ago
2008
IEEE
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
ASIAN
2004
Springer
14 years 27 days ago
2004
Springer
We propose a simple theory of expressions which is intended to be used as a foundational syntactic structure for the Natural Framework (NF). We define expression formally and give...
CSL
2005
Springer
14 years 1 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
POPL
2001
ACM
14 years 7 months ago
2001
ACM
We propose a general, powerful framework of type systems for the -calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial propert...