92 search results - page 11 / 19 » The simply typed rewriting calculus |
EUROCAST
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. This paper introduces a higher-order lazy narrowing calculus (HOLN for short) that solves higher-order equations over the domain of simply typed λ-terms. HOLN is an exte...
ENTCS
2007
13 years 7 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
SAS
1997
Springer
13 years 11 months ago
1997
Springer
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...
FLOPS
2004
Springer
14 years 26 days ago
2004
Springer
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
METAI is a generic process calculus that can be instantiated by supplying rewriting rules defining an operational semantics to make numerous process calculi such as the -calculus,...