Add to ORKGWe discuss how the 1st order specification and programming language ABEL could be extended with higher order functions. Several issues arise, related to subtyping, parameterization, strictness of generators and defined functions, and to the choice between lambda expressions and currying. The paper can be regarded as an exercise in language design: how to introduce higher order functions under the restrictions enforced by (1st order) ABEL. A technical result is a soundness proof for covariant subtype replacement, useful when implementing data types under volume constraints imposed by computer hardware
International audienceFunction uncurrying is an important optimization for the efficient execution o...
Higher-order abstract syntax is a simple technique for implementing languages with functional progra...
We introduce a variation on Barthe et al.’s higher-order logic in which formulas are interpreted as ...
We discuss how the 1'st order specification and programming language ABEL could be extended with hig...
AbstractThis paper gives a proposal for how order-sorted algebraic specification languages can be ex...
ABEL is a wide spectrum language developed at the University of Oslo. The applicative core of ABEL i...
. A higher order logic programming system is presented. The declarative semantics of the system is b...
The objective of this thesis is to provide a formal basis for higher-order features in the paradigm ...
This paper presents a case for the use of higher-order logic as a foundation for computational logic...
International audienceAbstract Unification is a central operation in constructing a range of computa...
Higher-order abstract syntax is a central representation technique in logical frameworks which maps ...
Abstract. In this report a new backward strictness analysis for functional languages is presented. I...
Part 1: Invited ContributionsInternational audienceA few forms of bisimulation and of coinductive te...
In this paper we investigate a logic for reasoning about programs with higher-order functions and ef...
The addition of logic variables to functional languages gives the programmer novel and powerful too...
International audienceFunction uncurrying is an important optimization for the efficient execution o...
Higher-order abstract syntax is a simple technique for implementing languages with functional progra...
We introduce a variation on Barthe et al.’s higher-order logic in which formulas are interpreted as ...
We discuss how the 1'st order specification and programming language ABEL could be extended with hig...
AbstractThis paper gives a proposal for how order-sorted algebraic specification languages can be ex...
ABEL is a wide spectrum language developed at the University of Oslo. The applicative core of ABEL i...
. A higher order logic programming system is presented. The declarative semantics of the system is b...
The objective of this thesis is to provide a formal basis for higher-order features in the paradigm ...
This paper presents a case for the use of higher-order logic as a foundation for computational logic...
International audienceAbstract Unification is a central operation in constructing a range of computa...
Higher-order abstract syntax is a central representation technique in logical frameworks which maps ...
Abstract. In this report a new backward strictness analysis for functional languages is presented. I...
Part 1: Invited ContributionsInternational audienceA few forms of bisimulation and of coinductive te...
In this paper we investigate a logic for reasoning about programs with higher-order functions and ef...
The addition of logic variables to functional languages gives the programmer novel and powerful too...
International audienceFunction uncurrying is an important optimization for the efficient execution o...
Higher-order abstract syntax is a simple technique for implementing languages with functional progra...
We introduce a variation on Barthe et al.’s higher-order logic in which formulas are interpreted as ...