37 search results - page 7 / 8 » Weak Equivalence in Propositional Calculus |
FOSSACS
2009
Springer
14 years 4 months ago
2009
Springer
Reactive systems, proposed by Leifer and Milner, represent a meta-framework aimed at deriving behavioral congruences for those specification formalisms whose operational semantics...
ESOP
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Propositional canonical Gentzen-type systems, introduced in [2], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Contemporary use of the term ’intension’ derives from the traditional logical Frege-Russell’s doctrine that an idea (logic formula) has both an extension and an intension. Al...
ICFP
2002
ACM
14 years 9 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...