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 of data and type constraints solving. By means of this translation, we describe how types can be used at run-time to prune the search space of solutions of a goal. Moreover, we present type inference and checking compile-time tools for the language showing its usefulness for improving computations.
منابع مشابه
Towards a Simply Typed CALculus for Semantic Knowledge Bases
This paper demonstrates how a constructive version of the description logic ALC can serve as a semantic type system for an extension of the simply typed λ-calculus to express computations in knowledge bases. This cALculus embodies a functional core language which provides static type checking of semantic information processing of data whose structure is organised under a relational data model a...
متن کاملA Monadic Formalization of ML5
ML5 is a programming language for spatially distributed computing, based on a Curry-Howard correspondence with the modal logic S5. However, the ML5 programming language differs from the logic in several ways. In this paper, we give a semantic embedding of ML5 into the dependently typed programming language Agda, which both explains these discrepancies between ML5 and S5 and suggests some simpli...
متن کاملProgramming with Higher-Order Logic
Formal systems that describe computations over syntactic structures occur frequently in computer science. Logic programming provides a natural framework for encoding and animating such systems. However, these systems often embody variable binding, a notion thatmust be treated carefully at a computational level. This book aims to show that a programming language based on a simply typed version o...
متن کاملAcceptors as Values Functional Programming in Classical Linear Logic ( Technical Summary )
Girard’s linear logic has been previously applied to functional programming for performing state-manipulation and controlling storage reuse. These applications only use intuitionistic linear logic, the subset of linear logic that embeds intuitionistic logic. Full linear logic (called classical linear logic) is much richer than this subset. In this paper, we consider the application of classical...
متن کاملCoinductive Session Types in Higher-Order Communication Centric Programs
We develop a theory of coinductive session types based on prior work on computational interpretations of linear logic propositions as session types. Unlike other more ad-hoc approaches to recursive session types, our typing discipline supports the compositional definition of potentially infinite interactive behaviour, as required to model realistic distributed systems, while remarkably forbiddi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998