Results 21 
25 of
25
Parallel Haskell: The vectorisation monad
, 1993
"... It has long been known that some of the most common uses of for and whileloops in imperative programs can easily be expressed using the standard higherorder functions fold and map. With this correspondence as a starting point, we derive parallel implementations of various iterative constructs, ea ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
It has long been known that some of the most common uses of for and whileloops in imperative programs can easily be expressed using the standard higherorder functions fold and map. With this correspondence as a starting point, we derive parallel implementations of various iterative constructs, each having a better complexity than their sequential counterparts, and explore the use of monads to guarantee the soundness of the parallel implementation. As an aid to the presentation of the material, we use the proposed syntax for parallel Haskell [27] (figure 1) as a vehicle in which imperative functional programs will be expressed. Surprisingly, incorporating imperative features into a purely functional language has become an active area of research within the functional programming community [30, 24, 36, 20]. One of the techniques gaining widespread acceptance as a model for imperative functional programming is monads [38, 37, 26]. Typically monads are used to guarantee single threadedn...
Prototype Proofs in Type Theory
, 2000
"... The proofs of universally quantified statements, in mathematics, are given as "schemata" or as "prototypes" which may be applied to each specific instance of the quantified variable. Type Theory allows to turn into a rigorous notion this informal intuition described by many, including Herbrand. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The proofs of universally quantified statements, in mathematics, are given as "schemata" or as "prototypes" which may be applied to each specific instance of the quantified variable. Type Theory allows to turn into a rigorous notion this informal intuition described by many, including Herbrand. In this constructive approach where propositions are types, proofs are viewed as terms of \Gammacalculus and act as "proofschemata", as for universally quantified types. We examine here the critical case of Impredicative Type Theory, i.e. Girard's system F, where typequantification ranges over all types. Coherence and decidability properties are proved for prototype proofs in this impredicative context.
Handbook of the History of Logic. Volume 6
"... ABSTRACT: Here is a crude list, possibly summarizing the role of paradoxes within the framework of mathematical logic: 1. directly motivating important theories (e.g. type theory, axiomatic set theory, combinatory logic); 2. suggesting methods of proving fundamental metamathematical results (fixed p ..."
Abstract
 Add to MetaCart
ABSTRACT: Here is a crude list, possibly summarizing the role of paradoxes within the framework of mathematical logic: 1. directly motivating important theories (e.g. type theory, axiomatic set theory, combinatory logic); 2. suggesting methods of proving fundamental metamathematical results (fixed point theorems, incompleteness, undecidability, undefinability); 3. applying inductive definability and generalized recursion; 4. introducing new semantical methods (e. g. revision theory, semiinductive definitions, which require nontrivial set theoretic results); 5. (partly) enhancing new axioms in set theory: the case of antifoundation AFA and the mathematics of circular phenomena; 6. suggesting the investigation of nonclassical logical systems, from contractionfree and manyvalued logics to systems with generalized quantifiers; 7. suggesting frameworks with flexible typing for the foundations of Mathematics and Computer Science; 8. applying forms of selfreferential truth and in Artificial Intelligence, Theoretical Linguistics, etc. Below we attempt to shed some light on the genesis of the issues 1–8 through the history of the paradoxes in the twentieth century, with a special emphasis on semantical aspects.
T ~ lot JR ~.AL CdF LOU__~ " PI~C~AMMiNG
, 1997
"... An algebraic framework for the definition of compositional semantics of normal logic programs ..."
Abstract
 Add to MetaCart
An algebraic framework for the definition of compositional semantics of normal logic programs