Results 1 - 10 of 62

example

by Bill Bryson, Simon Peyton Jones As, Gabriel Wurzer , 2012
"... Writing papers has always been a miracle. The most inspiring person for me in this respect is Simon Peyton Jones, a researcher working for Microsoft Research who has shown 'How to write a good research paper ' [1], among other very inter-esting guidelines [2][3]. In short, Peyton Jones is ..."
Abstract - Add to MetaCart
Writing papers has always been a miracle. The most inspiring person for me in this respect is Simon Peyton Jones, a researcher working for Microsoft Research who has shown 'How to write a good research paper ' [1], among other very inter-esting guidelines [2][3]. In short, Peyton Jones

Compiling Lazy Functional Programs to Java Bytecode

by Gary Meehan, Mike Joy , 1998
"... this paper). It is a simple, weakly-typed, pure lazy functional language with no pattern-matching or user-dened types. After parsing, the Ginger compiler transforms the source tree into a set of supercombinators (functions in which no free variables occur, see Section 13.2.1 of Peyton Jones (1987) ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
this paper). It is a simple, weakly-typed, pure lazy functional language with no pattern-matching or user-dened types. After parsing, the Ginger compiler transforms the source tree into a set of supercombinators (functions in which no free variables occur, see Section 13.2.1 of Peyton Jones (1987)

FUNCTIONAL PEARL Typed quote/antiquote or: Compile-time parsing

by Ralf Hinze
"... Haskell (Peyton Jones, 2003) is often used as a host language for embedding other languages. Typically, the abstract syntax of the guest language is defined by a collection of datatype declarations; parsers and pretty-printers convert between the concrete syntax and its abstract representation. A qu ..."
Abstract - Add to MetaCart
Haskell (Peyton Jones, 2003) is often used as a host language for embedding other languages. Typically, the abstract syntax of the guest language is defined by a collection of datatype declarations; parsers and pretty-printers convert between the concrete syntax and its abstract representation. A

Typed Quote/Antiquote

by Ralf Hinze
"... Haskell (Peyton Jones, 2003) is often used as a host for another language. Typically, the abstract syntax of the guest language is defined by a bunch of data type declarations; parsers and pretty-printers convert between the concrete syntax and its abstract representation. A quote/antiquote mechanis ..."
Abstract - Add to MetaCart
Haskell (Peyton Jones, 2003) is often used as a host for another language. Typically, the abstract syntax of the guest language is defined by a bunch of data type declarations; parsers and pretty-printers convert between the concrete syntax and its abstract representation. A quote

Featherweight Concurrency in a Portable Assembly Language

by Norman Ramsey, Simon Peyton Jones , 2001
"... What abstractions should a reusable code generator provide to make it easy for a language implementor to compile a highly concurrent language? The implementation of concurrency is typically tightly interwoven with the code generator and run-time system of the high-level language. Our contribution is ..."
Abstract - Cited by 11 (0 self) - Add to MetaCart
and target architecture (Peyton Jones, Oliva, and Nordin 1997; Peyton Jones, Ramsey, and Reig 1999; Ramsey and Peyton Jones 2000). It acts as an interface between a front end and a reusable code generator. The idea is that the front end translates your favorite language into C--, leaving the C-- compiler

Towards a Denotational Semantics for Concurrent State Transformers

by Peter Thiemann , 1995
"... Concurrent state transformers are an extension of state transformers investigated by Launchbury, Peyton Jones, Wadler, and others by concurrency primitives. A denotational semantics for state transformers executing in parallel is deøned using standard domain theoretic techniques. Using the semantics ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Concurrent state transformers are an extension of state transformers investigated by Launchbury, Peyton Jones, Wadler, and others by concurrency primitives. A denotational semantics for state transformers executing in parallel is deøned using standard domain theoretic techniques. Using

PASTEL A Parallel Stack-based Implementation of Eager Functional Programs with Lazy Data Structures (Extended Abstract)

by Guido Hogen, Rita Loogen , 1992
"... 1 Introduction In purely sequential implementations of functional programming languages a runtime stack is used for the control of the evaluation. Function calls lead to the allocation of control information (function blocks) on top of the stack. When the function call terminates, this information ..."
Abstract - Add to MetaCart
is removed and control is given back to the calling environment. In addition, a graph or heap structure is used for the representation of data structures, functional values (closures) and expressions not evaluated yet (suspensions), see e. g. [Johnsson 84], [Peyton Jones 87], [Koopman et al. 90], [Peyton

Structured REA contracts

by Kasper Østerbye , 2004
"... Introduction In the REA ontology, the contract is a reification of the reciprocal relationship between commitments. A commitment is a promise or expectation of a future event. However, sometimes contracts involve choices to be made, e.g. pay $100 before may 1 , or accept a 10% penalty (in additi ..."
Abstract - Add to MetaCart
addition to the $100). In [Peyton Jones, Eber, Seward, 2000] and [Peyton Jones, Eber, 2003] a contract specification language for financial contracts are proposed. We have adapted the language for REA. The adaptation has introduced two new types into REA, Instantiation and Resolution. Intuitively

Int J Softw Tools Technol Transfer (2006) 8:485–516 DOI 10.1007/s10009-006-0010-1 SPECIAL SECTION ON LEVERAGING APPLICATIONS OF FORMAL METHODS Compositional specification of commercial contracts

by Jesper Andersen, Ebbe Elsborg, Fritz Henglein, Jakob Grue, Simonsen Christian Stefansen, J. Andersen, J. G. Simonsen, C. Stefansen, E. Elsborg , 2006
"... Abstract We present a declarative language for compositional specification of contracts governing the exchange of resources. It extends Eber and Peyton Jones’s declarative language for specifying financial contracts (Jones et al. in The Fun of Programming. 2003) to the exchange of money, goods and s ..."
Abstract - Add to MetaCart
Abstract We present a declarative language for compositional specification of contracts governing the exchange of resources. It extends Eber and Peyton Jones’s declarative language for specifying financial contracts (Jones et al. in The Fun of Programming. 2003) to the exchange of money, goods

Monadic Regions

by Matthew Fluet, Greg Morrisett - UNDER CONSIDERATION FOR PUBLICATION IN J. FUNCTIONAL PROGRAMMING
"... Region-based type systems provide programmer control over memory management without sacrificing type-safety. However, the type systems for region-based languages, such as the ML-Kit or Cyclone, are relatively complicated, and proving their soundness is nontrivial. This paper shows that the complicat ..."
Abstract - Cited by 23 (1 self) - Add to MetaCart
of System F with region primitives whose types and operations are inspired by (and generalize) the ST monad of Launchbury and Peyton Jones.
Results 1 - 10 of 62