this paper are related to "program verification" very much like predicate logic and its completeness are related to axiomatic set theory; they are certainly relevant, but not of much help in establishing specific, concrete results. In its most general form, a recursive definition of a function is expressed by a fixpoint equation of the for
We develop a calculus for lazy functional programming based on recursion operators associated with d...
In this paper we explain how recursion operators can be used to structure and reason about program s...
Abstract. A theory of recursive definitions has been mechanized in Isabelle’s Zermelo-Fraenkel (ZF) ...
Abstract. We report work in progress concerning the theoretical basis and the implementation in the ...
Abstract A typed program logic LMF for recursive specification and veri-fication is presented. It co...
The functional systems of the recursive functions with closure software are investigated. The aim is...
AbstractFinitely typed functional programs are naturally classified by their levels. This syntactic ...
We study logical systems for reasoning about equations involving recursive de#nitions. In particula...
We consider the interaction of recursion with extensional data types in several typed functional pro...
What is functional programming? – Functions are first class (objects). – That is, everything you can...
AbstractWe show the adequacy of axioms and proof rules for strict and lazy functional programs. Our ...
In this paper we present an approach for modelling functional procedures (as they occur in imperativ...
Functional programming languages are shown to be useful in the teaching of the concepts of recursion...
Abstract:- The automatic programming system has been considered by means of which it becomes easier ...
AbstractFour different programming logics are compared by example. Three are versions of Martin-Löf ...
We develop a calculus for lazy functional programming based on recursion operators associated with d...
In this paper we explain how recursion operators can be used to structure and reason about program s...
Abstract. A theory of recursive definitions has been mechanized in Isabelle’s Zermelo-Fraenkel (ZF) ...
Abstract. We report work in progress concerning the theoretical basis and the implementation in the ...
Abstract A typed program logic LMF for recursive specification and veri-fication is presented. It co...
The functional systems of the recursive functions with closure software are investigated. The aim is...
AbstractFinitely typed functional programs are naturally classified by their levels. This syntactic ...
We study logical systems for reasoning about equations involving recursive de#nitions. In particula...
We consider the interaction of recursion with extensional data types in several typed functional pro...
What is functional programming? – Functions are first class (objects). – That is, everything you can...
AbstractWe show the adequacy of axioms and proof rules for strict and lazy functional programs. Our ...
In this paper we present an approach for modelling functional procedures (as they occur in imperativ...
Functional programming languages are shown to be useful in the teaching of the concepts of recursion...
Abstract:- The automatic programming system has been considered by means of which it becomes easier ...
AbstractFour different programming logics are compared by example. Three are versions of Martin-Löf ...
We develop a calculus for lazy functional programming based on recursion operators associated with d...
In this paper we explain how recursion operators can be used to structure and reason about program s...
Abstract. A theory of recursive definitions has been mechanized in Isabelle’s Zermelo-Fraenkel (ZF) ...
DOI
Add to ORKG