Results 1  10
of
487
Principal Typing and Mutual Recursion
 INTERNATIONAL WORKSHOP ON FUNCTIONAL AND LOGIC PROGRAMMING (WFLP 2001)
, 2001
"... As pointed out by Damas [Dam84], the DamasMilner system (ML) has principal types, but not principal typings. Damas also defined in his thesis a slightly modified version of ML, that we call ML', which, given a typing context and an expression, derives exactly the same types, and provided an al ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
an algorithm (named as T) that infers principal typings for ML'. This work extends each of ML' and T with a new rule for typing mutually recursive letbindings. The proposed rule can type more expressions than the corresponding rule used in ML, by allowing mutually recursive definitions to be used
Termination of Nested and Mutually Recursive Algorithms
, 1996
"... This paper deals with automated termination analysis for functional programs. Previously developed methods for automated termination proofs of functional programs often fail for algorithms with nested recursion and they cannot handle algorithms with mutual recursion. We show that termination proofs ..."
Abstract

Cited by 44 (9 self)
 Add to MetaCart
This paper deals with automated termination analysis for functional programs. Previously developed methods for automated termination proofs of functional programs often fail for algorithms with nested recursion and they cannot handle algorithms with mutual recursion. We show that termination proofs
Towards Manipulation of Mutually Recursive Functions
 In 3rd. Fuji International Symposium on Functional and Logic Programming (FLOPS’98
, 1998
"... In functional programming, Constructive Algorithmics is one of... In this paper, we shall formalize mutual recursive data types in terms of bifunctors and extend hylomorphisms to describe mutual recursive functions on this type. It is shown that theorems (transformation rules) for original hylomorph ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In functional programming, Constructive Algorithmics is one of... In this paper, we shall formalize mutual recursive data types in terms of bifunctors and extend hylomorphisms to describe mutual recursive functions on this type. It is shown that theorems (transformation rules) for original
On Mutually Recursive Free Types in Z
 In Proceedings International Conference of Z and B Users, ZB2000, LNCS
, 2000
"... . Mutually recursive free types are one of the innovations in the forthcoming ISO Standard for the Z notation. Their semantics has been specified by extending a formalization of the semantics of traditional Z free types to permit mutual recursion. That development is reflected in the structure o ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
. Mutually recursive free types are one of the innovations in the forthcoming ISO Standard for the Z notation. Their semantics has been specified by extending a formalization of the semantics of traditional Z free types to permit mutual recursion. That development is reflected in the structure
A Mechanism for Extensible Mutual Recursion
"... Abstract This paper summarizes an approach to extensible mutual recursion using what the author calls, "open modules." An open module effectively parameterizes its content so that it can be used both for the current module and future, extending modules. This paper discusses some of the is ..."
Abstract
 Add to MetaCart
Abstract This paper summarizes an approach to extensible mutual recursion using what the author calls, "open modules." An open module effectively parameterizes its content so that it can be used both for the current module and future, extending modules. This paper discusses some
Effective Support for Mutually Recursive Types
"... . For purposes of formal analysis, it is common to form a model of a system within a logic. This sometimes requires the introduction of new types which are mutually recursive. HOL90 has possessed for several years now two excellent libraries for mutually recursive types. Despite their powerful f ..."
Abstract
 Add to MetaCart
. For purposes of formal analysis, it is common to form a model of a system within a logic. This sometimes requires the introduction of new types which are mutually recursive. HOL90 has possessed for several years now two excellent libraries for mutually recursive types. Despite their powerful
Verification of Mutual Recursive Functional Programs
"... We present an environment for proving total correctness of mutual recursive functional programs. As usual, correctness is transformed into a set of firstorder predicate logic formulae—verification conditions. As a distinctive feature of our method, these formulae are not only sufficient, but also n ..."
Abstract
 Add to MetaCart
We present an environment for proving total correctness of mutual recursive functional programs. As usual, correctness is transformed into a set of firstorder predicate logic formulae—verification conditions. As a distinctive feature of our method, these formulae are not only sufficient, but also
Multipredicate induction schemes for mutual recursion
, 2000
"... Where mutually recursive data types are used in programming languages, etc., mutually recursive functions are usually required. Mutually recursive functions are also quite common for nonmutually recursive types. Reasoning about recursive functions requires some form of mathematical induction but th ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Where mutually recursive data types are used in programming languages, etc., mutually recursive functions are usually required. Mutually recursive functions are also quite common for nonmutually recursive types. Reasoning about recursive functions requires some form of mathematical induction
Axioms for Mutually Recursive Free Type Definitions
, 1997
"... This paper proposes a possible axiomatisation for mutually recursive free types for the draft Z standard. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper proposes a possible axiomatisation for mutually recursive free types for the draft Z standard.
Hoare Logic for Mutual Recursion and Local Variables
 Foundations of Software Technology and Theoretical Computer Science, volume 1738 of LNCS
, 1999
"... We present a (the first?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with callbyvalue parameters as well as global and local variables. For such a language we formalize an operational and an axiomatic semantics ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
We present a (the first?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with callbyvalue parameters as well as global and local variables. For such a language we formalize an operational and an axiomatic
Results 1  10
of
487