325 search results - page 36 / 65 » Abstract Rewriting |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
: This paper is concerned with the foundations of the Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions by inductive data types. CAC generali...
PPL
2008
13 years 7 months ago
2008
The aim of this work is to introduce a computational costs system associated to a semantic framework for orthogonal data and control parallelism handling. In such a framework a pa...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
RP
2009
Springer
14 years 2 months ago
2009
Springer
We present an abstraction of the probabilistic semantics of Multiset Rewriting to formally express systems of reactions with uncertain kinetic rates. This allows biological systems...
ICFP
2000
ACM
13 years 12 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...