Results 1  10
of
352,616
Recursive Definition
"... • Recursive selfreference occurs regularly – it has been studied extensively within the context of logic & computability ..."
Abstract
 Add to MetaCart
• Recursive selfreference occurs regularly – it has been studied extensively within the context of logic & computability
Recursive definitions
 Formalized Mathematics
, 1990
"... Summary. The text contains some schemes which allow elimination of definitions by recursion. ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Summary. The text contains some schemes which allow elimination of definitions by recursion.
Recursive Definitions
"... Summary. The text contains some schemes which allow elimination of defintions by recursion. MML Identifier: RECDEF 1. The papers [5], [1], [3], [2], and [4] provide the notation and terminology for this paper. We follow a convention: n, m, k will denote natural numbers and x, y, z, y1, y2 will be ar ..."
Abstract
 Add to MetaCart
Summary. The text contains some schemes which allow elimination of defintions by recursion. MML Identifier: RECDEF 1. The papers [5], [1], [3], [2], and [4] provide the notation and terminology for this paper. We follow a convention: n, m, k will denote natural numbers and x, y, z, y1, y2
Positive InductiveRecursive Definitions
"... Abstract. We introduce a new theory of data types which allows for the definition of data types as initial algebras of certain functors FamC→ FamC. This theory, which we call positive inductiverecursive definitions, is a generalisation of Dybjer and Setzer’s theory of inductiverecursive definition ..."
Abstract
 Add to MetaCart
Abstract. We introduce a new theory of data types which allows for the definition of data types as initial algebras of certain functors FamC→ FamC. This theory, which we call positive inductiverecursive definitions, is a generalisation of Dybjer and Setzer’s theory of inductiverecursive
Consistency of Recursive Definitions
, 2005
"... Recursive definitions can be adequately and conveniently modeled with leftlinear conditional term rewriting systems, provided that nontermination, nontrivial critical pairs, and extra variables are admitted. Confluence of such systems guarantees the objectlevel consistency of the underlying data ..."
Abstract
 Add to MetaCart
Recursive definitions can be adequately and conveniently modeled with leftlinear conditional term rewriting systems, provided that nontermination, nontrivial critical pairs, and extra variables are admitted. Confluence of such systems guarantees the objectlevel consistency of the underlying
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
Graph polynomials: From recursive definitions . . .
, 2008
"... Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logicbased framework which gives a precise meaning to recursive definitions of gr ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logicbased framework which gives a precise meaning to recursive definitions
Recursive definitions of monadic functions
 In Proc. of PAR 2010
, 2010
"... Using standard domaintheoretic fixedpoints, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the stateexception monad of Isabelle/HOL’s imperative programming extension, which results in a convenient ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
convenient definition principle for imperative programs, which were previously hard to define. For such monadic functions, the recursion equation can always be derived without preconditions, even if the function is partial. The construction is easy to automate, and convenient induction principles can
Recursive Definitions in Z
 ZUM’98: The Z Formal Specification Notation, volume 1493 of Lecture Notes in Computer Science
, 1998
"... This paper considers some issues in the theory and practice of defining functions over recursive data types in Z. Principles justifying such definitions are formulated. Z free types are contrasted with the free algebras of universal algebra: the notions turn out to be related but not isomorphic. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This paper considers some issues in the theory and practice of defining functions over recursive data types in Z. Principles justifying such definitions are formulated. Z free types are contrasted with the free algebras of universal algebra: the notions turn out to be related but not isomorphic.
Results 1  10
of
352,616