1101 search results - page 100 / 221 » Forcing in proof theory |
114
click to vote
FMCAD
2006
Springer
15 years 4 months ago
2006
Springer
We describe a link between the ACL2 and HOL mechanical proof assistants that enables the strengths of each system to be deployed smoothly within a single formal development. Severa...
109
click to vote
JELIA
1990
Springer
15 years 4 months ago
1990
Springer
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
205
Voted
ICFP
2009
ACM
16 years 1 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...
185
click to vote
POPL
2009
ACM
16 years 1 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
210
Voted
POPL
2006
ACM
16 years 28 days ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...