Results 1  10
of
896,970
Polytypic Values Possess Polykinded Types
, 2000
"... A polytypic value is one that is defined by induction on the structure of types. In Haskell the type structure is described by the socalled kind system, which distinguishes between manifest types like the type of integers and functions on types like the list type constructor. Previous approaches to ..."
Abstract

Cited by 109 (19 self)
 Add to MetaCart
examples that demonstrate that the additional exibility is useful in practice. One paradigmatic example is the mapping function, which describes the functorial action on arrows. A single polytypic definition yields mapping functions for datatypes of arbitrary kinds including first and higher
Insertion sequences
 Microbiol Mol. Biol. Rev
, 1998
"... These include: Receive: RSS Feeds, eTOCs, free email alerts (when new articles cite this article), more» Downloaded from ..."
Abstract

Cited by 426 (3 self)
 Add to MetaCart
These include: Receive: RSS Feeds, eTOCs, free email alerts (when new articles cite this article), more» Downloaded from
POLYTYPIC PROVING
, 2010
"... iacknowledgments I wish to thank Charles Fischer and Ben Liblit, sine quibus non. Others who have contributed significantly to the progress of this thesis are: • The people who have attended my Coq seminars. • The members of the CBI team, past and present. • The members of the administrative staff i ..."
Abstract
 Add to MetaCart
iacknowledgments I wish to thank Charles Fischer and Ben Liblit, sine quibus non. Others who have contributed significantly to the progress of this thesis are: • The people who have attended my Coq seminars. • The members of the CBI team, past and present. • The members of the administrative staff in the department, past and present. I would like to thank them as well. I would like to thank the members of my committee and Robert Wilson. I would like to thank Jon Giffin for giving me honest, clear, and unaffected answers to puzzling C++ questions, among other things. I would like to thank Tristan Ravitch for introducing me to presentations with Beamer, among other things. I would like to thank Will Benton for many things, including providing
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
Calculate Polytypically!
 In PLILP'96, volume 1140 of LNCS
, 1996
"... A polytypic function definition is a function definition that is parametrised with a datatype. It embraces a class of algorithms. As an example we define a simple polytypic "crush" combinator that can be used to calculate polytypically. The ability to define functions polytypically adds an ..."
Abstract

Cited by 41 (3 self)
 Add to MetaCart
A polytypic function definition is a function definition that is parametrised with a datatype. It embraces a class of algorithms. As an example we define a simple polytypic "crush" combinator that can be used to calculate polytypically. The ability to define functions polytypically adds
Polytypic Abstraction in Type Theory
 Informal Proceedings of Workshop on Generic Programming (WGP98). Marstrand
, 1998
"... ion in Type Theory H. Pfeifer and H. Rueß Universitat Ulm Fakultat fur Informatik D89069 Ulm, Germany fpfeifer,ruessg@informatik.uniulm.de Abstract. This paper is concerned with formalizations and verifications in type theory that are abstracted with respect to a large class of datatypes; i.e po ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
theoretic setting is exemplified by the definition of a polytypic map function and by mechanized proofs of corresponding properties such as preservation of composition and fusion theorems. 1 Introduction Many functional programming languages provide a predefined map functional on the list datatype. Applying
Polytypic Programming With Ease
, 1999
"... A functional polytypic program is one that is parameterised by datatype. Since polytypic functions are defined by induction on types rather than by induction on values they typically operate on a higher level of abstraction than their monotypic counterparts. However, polytypic programming is not nec ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
A functional polytypic program is one that is parameterised by datatype. Since polytypic functions are defined by induction on types rather than by induction on values they typically operate on a higher level of abstraction than their monotypic counterparts. However, polytypic programming
Polytypic Recursion Patterns
, 2000
"... Recursive schemes over inductive data structures have been recognized as categorytheoretic universals, yielding a handful of equational laws for program construction and transformation. This paper introduces the implementation of such recursion patterns as type parametric, or polytypic, functionals ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Recursive schemes over inductive data structures have been recognized as categorytheoretic universals, yielding a handful of equational laws for program construction and transformation. This paper introduces the implementation of such recursion patterns as type parametric, or polytypic
Polytypism and Polytypic Unification
, 1995
"... This report describes what polytypic programming is, a new system for writing polytypic functions, and a number of useful example functions including generalised versions of map, zip and a specific lazy array based unification algorithm. Sammanfattning Denna rapport beskriver hur man med ett program ..."
Abstract
 Add to MetaCart
This report describes what polytypic programming is, a new system for writing polytypic functions, and a number of useful example functions including generalised versions of map, zip and a specific lazy array based unification algorithm. Sammanfattning Denna rapport beskriver hur man med ett
Abstract Polytypic Recursion Patterns
"... Recursive schemes over inductive data structures have been recognized as categorytheoretic universals, yielding a handful of equational laws for program construction and transformation. This paper introduces the implementation of such recursion patterns as type parametric, or polytypic, functionals ..."
Abstract
 Add to MetaCart
Recursive schemes over inductive data structures have been recognized as categorytheoretic universals, yielding a handful of equational laws for program construction and transformation. This paper introduces the implementation of such recursion patterns as type parametric, or polytypic, functionals
Results 1  10
of
896,970