3552 search results - page 125 / 711 » Proof theory in the abstract |
176
click to vote
TCS
2011
15 years 1 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
153
click to vote
LPAR
2005
Springer
15 years 12 months ago
2005
Springer
An overview is given of a number of recent developments in SAT and SAT Modulo Theories (SMT). In particular, based on our k of Abstract DPLL and Abstract DPLL modulo Theories, we e...
152
click to vote
LICS
2007
IEEE
16 years 19 days ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
157
click to vote
DBPL
2007
Springer
16 years 16 days ago
2007
Springer
Data streams are modeled as infinite or finite sequences of data elements coming from an arbitrary but fixed universe. The universe can have various built-in functions and predi...
155
click to vote
FPLE
1995
15 years 10 months ago
1995
Abstract. A hierarchy of six important structures from abstract algebra (groups, rings, fields etc.) is introduced as Gofer class definitions and laws about them. Many instance d...