98 search results - page 6 / 20 » A Proof Theoretic Approach to Operational Semantics |
111
click to vote
AMAST
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We present a static analysis technique for modeling and approximating the long-run resource usage of programs. The approach is based on a quantitative semantic framework ...
134
click to vote
ENTCS
2006
15 years 1 months ago
2006
In this paper we introduce a new approach to formalizing certain type operations in type theory. Traditionally, many type constructors in type theory are independently axiomatized...
115
Voted
TAMC
2010
Springer
15 years 6 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
122
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
113
click to vote
PPDP
2004
Springer
15 years 7 months ago
2004
Springer
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...