Add to ORKGSEQUEL is a new-generation functional programming language, which allows the specification of types in a notation based on the sequent calculus. The sequent calculus notation suffices for the construction of types for type checking and for the specification of arbitrary logics. Compilation techniques derived from both functional and logic programming are used to derive high-performance ATPs from these specifications.
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
In this chapter, we propose a framework for logic programming with different type systems. In this f...
This paper is concerned with the type analysis of logic programs where, by type, we mean a property ...
We demonstrate how the framework of higher-order logic programming ...
Declarative programming languages, are high-level programming languages in which one only has to sta...
AbstractThe type-free λ-calculus is powerful enough to contain all the polymorphic and higher-order ...
The type-free ¿-calculus is powerful enough to contain all the polymorphic and higher-order nature o...
International audienceFormal systems that describe computations over syntactic structures occur freq...
AbstractMuch attention has been focused by the declarative languages community on combining the func...
Much attention has been focused by the declarative languages community on combining the functional ...
The logic programming refinement calculus is a method for transforming specifications to executable ...
This paper shows the advantages of amalgamating functional and logic programming languages. In compa...
A functional language is introduced, whose type system is defined by its meta-circular interpreter. ...
Programmers don't just have to write programs, they are have to reason about them. Programming langu...
It has been argued elsewhere that a logic programming language with function variables and A-abstrac...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
In this chapter, we propose a framework for logic programming with different type systems. In this f...
This paper is concerned with the type analysis of logic programs where, by type, we mean a property ...
We demonstrate how the framework of higher-order logic programming ...
Declarative programming languages, are high-level programming languages in which one only has to sta...
AbstractThe type-free λ-calculus is powerful enough to contain all the polymorphic and higher-order ...
The type-free ¿-calculus is powerful enough to contain all the polymorphic and higher-order nature o...
International audienceFormal systems that describe computations over syntactic structures occur freq...
AbstractMuch attention has been focused by the declarative languages community on combining the func...
Much attention has been focused by the declarative languages community on combining the functional ...
The logic programming refinement calculus is a method for transforming specifications to executable ...
This paper shows the advantages of amalgamating functional and logic programming languages. In compa...
A functional language is introduced, whose type system is defined by its meta-circular interpreter. ...
Programmers don't just have to write programs, they are have to reason about them. Programming langu...
It has been argued elsewhere that a logic programming language with function variables and A-abstrac...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
In this chapter, we propose a framework for logic programming with different type systems. In this f...
This paper is concerned with the type analysis of logic programs where, by type, we mean a property ...