Sciweavers

1000 search results - page 106 / 200
» Nominal rewriting systems
Sort
View
ICTAI
1996
IEEE
15 years 10 months ago
Binary CSP Solving as an Inference Process
We describe constraint solving using a rule-based approach. The distinction made between deduction rules and strategies by computational systems allows us to improve our understan...
Carlos Castro
TACS
1994
Springer
15 years 10 months ago
Syntactic Definitions of Undefined: On Defining the Undefined
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
Zena M. Ariola, Richard Kennaway, Jan Willem Klop,...
ACL
2006
15 years 7 months ago
Polarized Unification Grammars
This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags, graphs and products of them. The polarization of the objects ...
Sylvain Kahane
INFORMATICALT
2000
108views more  INFORMATICALT 2000»
15 years 6 months ago
Theoretical Foundations of an Environment-Based Multiparadigm Language
The paper presents a simple programming language and rewriting system called GENS. It is based on an extension of the -calculus called E-calculus. GENS is a multiparadigm language:...
Mario Blazevic, Zoran Budimac, Mirjana Ivanovic
DAC
2008
ACM
16 years 7 months ago
Characterizing chip-multiprocessor variability-tolerance
Spatially-correlated intra-die process variations result in significant core-to-core frequency variations in chip-multiprocessors. An analytical model for frequency island chip-mu...
Sebastian Herbert, Diana Marculescu