60 search results - page 12 / 12 » Proof Terms for Simply Typed Higher Order Logic |
TPHOL
1997
IEEE
13 years 9 months ago
1997
IEEE
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...
ITICSE
2003
ACM
13 years 10 months ago
2003
ACM
Because the concept of program correctness is generally taught as an activity independent of the programming process, most introductory computer science (CS) students perceive it ...
HPCA
2011
IEEE
12 years 9 months ago
2011
IEEE
Over the last twenty years the interfaces for accessing persistent storage within a computer system have remained essentially unchanged. Simply put, seek, read and write have deï¬...
ICFP
2005
ACM
14 years 5 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
FOAL
2008
ACM
13 years 6 months ago
2008
ACM
Often, insertion of several aspects into one system is desired and in that case the problem of interference among the different aspects might arise, even if each aspect individual...