Partial evaluation of functional logic programs
Languages that integrate functional and logic programming with a complete operational
semantics are based on narrowing, a unification-based goal-solving mechanism which …
semantics are based on narrowing, a unification-based goal-solving mechanism which …
Similar meltwater contributions to glacial sea level changes from Antarctic and northern ice sheets
Abstract The period between 75,000 and 20,000 years ago was characterized by high
variability in climate,,,,,,,,,,, and sea level,. Southern Ocean records of ice-rafted debris …
variability in climate,,,,,,,,,,, and sea level,. Southern Ocean records of ice-rafted debris …
Logic program specialisation through partial deduction: Control issues
Program specialisation aims at improving the overall performance of programs by
performing source to source transformations. A common approach within functional and …
performing source to source transformations. A common approach within functional and …
On the power of homeomorphic embedding for online termination
M Leuschel - International Static Analysis Symposium, 1998 - Springer
Recently well-quasi orders in general, and homeomorphic embedding in particular, have
gained popularity to ensure the termination of program analysis, specialisation and …
gained popularity to ensure the termination of program analysis, specialisation and …
Lightweight modular staging and embedded compilers: Abstraction without regret for high-level high-performance programming
T Rompf - 2012 - infoscience.epfl.ch
Programs expressed in a high-level programming language need to be translated to a low-
level machine dialect for execution. This translation is usually accomplished by a compiler …
level machine dialect for execution. This translation is usually accomplished by a compiler …
Principles of inverse computation and the universal resolving algorithm
We survey fundamental concepts in inverse programming and present the Universal
Resolving Algorithm (URA), an algorithm for inverse computation in a first-order, functional …
Resolving Algorithm (URA), an algorithm for inverse computation in a first-order, functional …
A program inverter for a functional language with equality and constructors
R Glück, M Kawabe - Asian Symposium on Programming Languages and …, 2003 - Springer
We present a method for automatic program inversion in a first-order functional
programming language. We formalize the transformation and illustrate it with several …
programming language. We formalize the transformation and illustrate it with several …
Homeomorphic embedding for online termination of symbolic methods
M Leuschel - The essence of computation: complexity, analysis …, 2002 - Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained
popularity to ensure the termination of techniques for program analysis, specialisation …
popularity to ensure the termination of techniques for program analysis, specialisation …
The Long Way to Deforestation: A Type Inference and Elaboration Technique for Removing Intermediate Data Structures
Y Chen, L Parreaux - Proceedings of the ACM on Programming …, 2024 - dl.acm.org
Deforestation is a compiler optimization that removes intermediate data structure allocations
from functional programs to improve their efficiency. This is an old idea, but previous …
from functional programs to improve their efficiency. This is an old idea, but previous …
The universal resolving algorithm and its correctness: inverse computation in a functional language
We present an algorithm for inverse computation in a first-order functional language based
on the notion of a perfect process tree. The Universal Resolving Algorithm introduced in this …
on the notion of a perfect process tree. The Universal Resolving Algorithm introduced in this …