Lazy Narrowing with Parametric Order Sorted Types

@inproceedings{AlmendrosJimnez1997LazyNW,
  title={Lazy Narrowing with Parametric Order Sorted Types},
  author={Jes{\'u}s Manuel Almendros-Jim{\'e}nez and Ana Gil-Luezas},
  booktitle={ALP/HOA},
  year={1997}
}
Recently, a model theoretic semantics for lazy functional programming combining parametric and inclusion polymorphism has been proposed in [2]. The aim of the present work is to provide the previous one with the incorporation of a typed lazy narrowing calculus for goal solving which combines lazy unification, sharing and type checking at run-time. Furthermore, we state soundness and completeness results of the goal solving procedure w.r.t. the typed rewriting calculi presented in [2] which were… 
Improving Computations in a Typed Functional Logic Language
We propose an implementation of a functional logic language with parametric order sorted types by translating typed lazy narrowing into Prolog, and establishing a reasonable strategy of combination
Algebraic Semantics for Functional Logic Programming with Polymorphic Order-Sorted Types
TLDR
The immediate consequence operator is defined, proving that the Hebrand model is the least model of a program and the free term algebra with variables is freely generated in the category of models.
A general framework for lazy functional logic programming with algebraic polymorphic types
TLDR
It is argued that equational logic does not supply the proper semantics for first-order functional logic programming, and an alternative logic is presented which includes [Cscr ]-based rewriting calculi and a notion of model is presented.
Una aproximación al fallo en programación declarativa multiparadigma
La negacion en programacion logica es un tema ampliamente investigado desde los inicios de este estilo de programacion. En este trabajo se estudia un recurso similar para la programacion

References

SHOWING 1-10 OF 31 REFERENCES
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming
TLDR
It is argued that existing calculi for lazy narrowing either do not apply to applicative systems or handle applicative terms very inefficiently, and a new lazy narrowing calculus for applicative term rewriting systems is proposed and proved.
A Rewriting Logic for Declarative Programming
TLDR
An approach to declarative programming which integrates the functional and relational paradigms by taking possibly non-deterministic lazy functions as the fundamental notion is proposed and the existence of free term models which provide an adequate intended semantics for programs is proved.
Algebraic Semantics for Functional Logic Programming with Polymorphic Order-Sorted Types
TLDR
The immediate consequence operator is defined, proving that the Hebrand model is the least model of a program and the free term algebra with variables is freely generated in the category of models.
Logic Programming over Polymorphically Order-Sorted Types
TLDR
This thesis presents the foundations for relational logic programming over polymorphically order-sorted data types, which are obtained as canonical models of a class of speci cations in a suitable logic accommodating sort functions.
A Functional and Logic Language with Polymorphic Types (Extended Abstract)
TLDR
An equational logic language with a polymorphic type system that integrates two interesting programming styles in a type secure way: functional and logic programming and run-time optimizations are proposed.
A Polymorphic Type System for Prolog
Type inference with subtypes
TLDR
A type system for deriving types of expressions in the language and an algorithm for type inference in a language with functions, records, and variant records is given, which is a synthesis of subtype polymorphism and universal polymorphism.
Type Inferencing for Polymorphic Order-Sorted Logic Programs
TLDR
A complete type inferencing algorithm that covers the polymorphic order-sorted types in PROTOS-L, a logic programming language that allows for polymorphism as in ML and for hierarchically structured monomorphic types.
Parametric Order-Sorted Types in Logic Programming
  • M. Hanus
  • Computer Science
    TAPSOFT, Vol.2
  • 1991
TLDR
This paper proposes a type system for logic programming where types are structured in two ways: Firstly, functions and predicates may be declared with types containing type parameters which are universally quantified over all types, and secondly, types are related by subset inclusions.
...
...