Sciweavers

65 search results - page 9 / 13
» Definitions by Rewriting in the Calculus of Constructions
Sort
View
FOSSACS
2004
Springer
15 years 1 months ago
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi
In the literature there are several CCS-like process calculi differing in the constructs for the specification of infinite behavior and in the scoping rules for channel names. In t...
Pablo Giambiagi, Gerardo Schneider, Frank D. Valen...
TABLEAUX
2009
Springer
15 years 2 months ago
Tableaux for Projection Computation and Knowledge Compilation
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. O...
Christoph Wernhard
ENTCS
2002
97views more  ENTCS 2002»
14 years 9 months ago
Plan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
Mark-Oliver Stehr, Carolyn L. Talcott
JLP
2010
96views more  JLP 2010»
14 years 4 months ago
An overview of the K semantic framework
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of configurations, comput...
Grigore Rosu, Traian-Florin Serbanuta
83
Voted
ICFP
2002
ACM
15 years 9 months ago
Tagless staged interpreters for typed languages
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...
Emir Pasalic, Walid Taha, Tim Sheard