Sciweavers

206 search results - page 19 / 42
» Semantics, modularity, and rewriting logic
Sort
View
93
Voted
IANDC
2010
102views more  IANDC 2010»
14 years 11 months ago
Presenting functors on many-sorted varieties and applications
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
Alexander Kurz, Daniela Petrisan
FSTTCS
1993
Springer
15 years 4 months ago
Higher-Order and Semantic Unification
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...
Nachum Dershowitz, Subrata Mitra
117
Voted
SARA
2009
Springer
15 years 5 months ago
Rewriting Constraint Models with Metamodels
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...
Raphaël Chenouard, Laurent Granvilliers, Rica...
220
Voted
AMW
2011
14 years 4 months ago
Subqueries in SPARQL
Subqueries are a poweful feature which allows to enforce reuse, composition, rewriting and optimization in a query language. In this paper we perform a comprehensive study of the i...
Renzo Angles, Claudio Gutierrez
90
Voted
CORR
2011
Springer
170views Education» more  CORR 2011»
14 years 4 months ago
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluat...
Andreas Abel, Thierry Coquand, Miguel Pagano