Sciweavers

351 search results - page 51 / 71
» Nominal Equational Logic
Sort
View
CADE
2003
Springer
14 years 7 months ago
Canonization for Disjoint Unions of Theories
If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the d...
Sava Krstic, Sylvain Conchon
ISQED
2005
IEEE
98views Hardware» more  ISQED 2005»
14 years 1 months ago
A More Effective CEFF
Precise chip-level timing requires careful modeling of the interaction between logic drivers and interconnect. Existing static-timing analysis methodologies generate models for dr...
Sani R. Nassif, Zhuo Li
AMAST
2004
Springer
14 years 29 days ago
Generic Exception Handling and the Java Monad
We develop an equational definition of exception monads that characterizes Moggi’s exception monad transformer. This axiomatization is then used to define an extension of previ...
Lutz Schröder, Till Mossakowski
LICS
1994
IEEE
13 years 11 months ago
Higher-Order Narrowing
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
Christian Prehofer
ESOP
2008
Springer
13 years 9 months ago
A Realizability Model for Impredicative Hoare Type Theory
We present a denotational model of impredicative Hoare Type Theory, a very expressive dependent type theory in which one can and reason about mutable abstract data types. The model...
Rasmus Lerchedahl Petersen, Lars Birkedal, Aleksan...