144 search results - page 12 / 29 » A Fully Abstract Semantics for a Functional Language with Lo... |
TCS
2011
13 years 3 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 ...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
POPL
2003
ACM
14 years 9 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
POPL
2012
ACM
12 years 4 months ago
2012
ACM
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
CAV
2009
Springer
14 years 9 months ago
2009
Springer
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...