Sciweavers

3562 search results - page 224 / 713
» Introduction to Logic Programming
Sort
View
ICLP
2003
Springer
16 years 6 days ago
Termination Analysis with Types Is More Accurate
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
Vitaly Lagoon, Frédéric Mesnard, Pet...
205
Voted
ISORC
2005
IEEE
16 years 18 days ago
Heterogeneous Adaptive Component-Based Applications with Adaptive.Net
Adaptation to changing environmental conditions is a major challenge for most distributed applications. The service-oriented programming paradigm leads to an increasing number of ...
Andreas Rasche, Marco Puhlmann, Andreas Polze
213
Voted
APLAS
2008
ACM
15 years 9 months ago
Abstraction of Clocks in Synchronous Data-Flow Systems
ion of Clocks in Synchronous Data-flow Systems Albert Cohen1 , Louis Mandel2 , Florence Plateau2 , and Marc Pouzet23 1 INRIA Saclay - Ile-de-France, Orsay, France 2 LRI, Univ. Pari...
Albert Cohen, Louis Mandel, Florence Plateau, Marc...
ICFP
2009
ACM
16 years 7 months ago
Biorthogonality, step-indexing and compiler correctness
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
Nick Benton, Chung-Kil Hur
189
Voted
PPDP
2007
Springer
16 years 1 months ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel