Sciweavers

1638 search results - page 212 / 328
» A General Semantics for Evaluation Logic
Sort
View
ICFP
2005
ACM
16 years 6 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
ICFP
2005
ACM
16 years 6 months ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power
PPDP
2007
Springer
16 years 16 days ago
Unfolding in CHR
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
Paolo Tacchella, Maurizio Gabbrielli, Maria Chiara...
CORR
2000
Springer
144views Education» more  CORR 2000»
15 years 6 months ago
Sequence-Based Abstract Interpretation of Prolog
-BASED ABSTRACT INTERPRETATION OF PROLOG1 BAUDOUIN LE CHARLIER, SABINA ROSSI, AND PASCAL VAN HENTENRYCK . Abstract interpretation is a general methodology for systematic developmen...
Baudouin Le Charlier, Sabina Rossi, Pascal Van Hen...
PODS
2011
ACM
201views Database» more  PODS 2011»
14 years 9 months ago
Data exchange beyond complete data
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...