Moran, Andrew, Zhao, Dong, Gu, Dongfeng, Coxson, Pamela, Chen, Chung-Shiuan, Cheng, Jun, ...
Abstract Background China will experience an overall growth and aging of its adult population in coming decades. We used a computer model to forecast the future impact of these demographic changes on...
Imprecise Exceptions, Co-Inductively (2007)
Andrew Moran, Soeren Lassen, Simon Peyton Jones
In a recent paper, Peyton Jones et al. proposed a design for imprecise exceptions in the lazy functional programming language Haskell [PJRH + 99]. The main contribution of the design was that it...
Abstract Semantics of fixIO (2007)
Levent Erkök, John Launchbury, Andrew Moran
Recent work on recursion over the values of monadic actions resulted in the introduction of a family of fixed point operators, one for each different kind of monadic effect. In the context of...
Erratic Fudgets: a semantic theory for an embedded coordination language (2003)
Andrew Moran, David Sands, Magnus Carlsson
The powerful abstraction mechanisms of functional programming languages provide the means to develop domain-specific programming languages within the language itself. Typically, this is realised by...
Lambda Calculi and Linear Speedups (2002)
David Sands, David S, Jörgen Gustavsson, Andrew Moran
The equational theories at the core of most functional programming are variations on the standard lambda calculus. The bestknown of these is the call-by-value lambda calculus whose core is the...
Semantics of value recursion for monadic input/output (2002)
Levent Erkök, John Launchbury, Andrew Moran
Abstract. Monads have been employed in programming languages for modeling various language features, most importantly those that involve side effects. In particular, Haskell’s IO monad provides...
Social research for WAND and new media adoption on a local scale (2002)
Arianna Bassoli, Irene Quinn, Mark Agius, Andrew Moran, Valentina Nisi, Paolo Dini
Asynchronous exceptions in Haskell (2001)
Simon Marlow, Simon Peyton Jones, Andrew Moran
Asynchronous exceptions, such as timeouts, are important for robust, modular programs, but are extremely difficult to program with--- so much so that most programming languages either heavily...
Asynchronous exceptions in Haskell (2001)
Simon Marlow, Simon Peyton Jones, Andrew Moran
Asynchronous exceptions, such as timeouts, are important for robust, modular programs, but are extremely dicult to program with | so much so that most programming languages either heavily restrict...
Asynchronous Exceptions in Haskell (2000)
Simon Marlow, Simon Peyton Jones, Andrew Moran
Asynchronous exceptions, such as timeouts, are important for robust, modular programs, but are extremely dicult to program with | so much so that most programming languages either heavily restrict...
Asynchronous Exceptions in Haskell (2000)
Simon Marlow, Simon Peyton Jones, Andrew Moran
Asynchronous exceptions, such as timeouts, are important for robust, modular programs, but are extremely dicult to program with | so much so that most programming languages either heavily restrict...
Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language (1999)
Andrew Moran, David Sands, David S, Magnus Carlsson
. The powerful abstraction mechanisms of functional programming languages provide the means to develop domain-specific programming languages within the language itself. Typically, this is realised by...
Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language (1999)
Andrew Moran, David Sands, David S, Magnus Carlsson
. The powerful abstraction mechanisms of functional programming languages provide the means to develop domain-specic programming languages within the language itself. Typically, this is realised by...
Improvement in a Lazy Context: An Operational Theory for Call-By-Need (1999)
Machine The semantics presented in this section is essentially Sestoft's \mark 1" abstract machine for laziness [Sestoft 1997]. In that paper, he proves his abstract machine 6 A. K. Moran...
Improvement in a Lazy Context: An Operational Theory for Call-By-Need (1999)
Andrew Moran Oregon, Andrew Moran, David Sands
Machine The semantics presented in this section is essentially Sestoft's \mark 1" abstract machine for laziness [Sestoft 1997]. In that paper, he proves his abstract machine 6 A. K. Moran...
Unique Fixed Point Induction for McCarthy's Amb (1999)
. We develop an operational theory of higher-order functions, recursion, and fair non-determinism for a non-trivial, higher-order, callby -name functional programming language extended with...
Improvement in a Lazy Context: An Operational Theory for Call-By-Need (Extended Version) (1999)
The standard implementation technique for lazy functional languages is call-by-need, which ensures that an argument to a function in any given call is evaluated at most once. A significant problem...
Imprecise Exceptions, Co-Inductively (1999)
Andrew Moran Oregon, Andrew Moran, Sren B. Lassen, Simon Peyton Jones
In a recent paper, Peyton Jones et al. proposed a design for imprecise exceptions in the lazy functional programming language Haskell [PJRH + 99]. The main contribution of the design was that it...
Unique Fixed Point Induction for McCarthy's Amb (1999)
Sren Lassen And, Sren B. Lassen, Andrew Moran
. We develop an operational theory of higher-order functions, recursion, and fair non-determinism for a non-trivial, higher-order, callby -name functional programming language extended with...
Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language (1999)
Andrew Moran, David Sands, David S, Magnus Carlsson
The powerful abstraction mechanisms of functional programming languages provide the means to develop domain-specic programming languages within the language itself. Typically, this is realised by...
Imprecise Exceptions, Co-Inductively (1999)
Andrew Moran, Søren B. Lassen, S��ren B. Lassen, Simon Peyton Jones
In a recent paper, Peyton Jones et al. proposed a design for imprecise exceptions in the lazy functional programming language Haskell [PJRH + 99]. The main contribution of the design was that it...
We present a natural semantics that models the untyped, normal order -calculus plus McCarthy's amb in the context of call-by-need parameter passing. This results in a singular semantics for amb....
John Hughes Andrew, Andrew Moran
We present a natural semantics that models the untyped, normal order -calculus plus McCarthy's amb in the context of call-by-need parameter passing. This results in a singular semantics for amb....
Natural Semantics for Non-Determinism (1993)
We present a natural semantics for the untyped lazy -calculus plus McCarthy's amb, a nondeterministic choice operator. The natural semantics includes rules for both convergent behaviour (dened...
Natural Semantics for Non-Determinism (1993)
We present a natural semantics for the untyped lazy -calculus plus McCarthy's amb, a nondeterministic choice operator. The natural semantics includes rules for both convergent behaviour (dened...
Natural Semantics for Non-Determinism (1993)
We present a natural semantics for the untyped lazy -calculus plus McCarthy's amb, a nondeterministic choice operator. The natural semantics includes rules for both convergent behaviour (deøned...
The origin of vibrational mode couplings in various secondary structural motifs of polypeptides
Electrostatic (through-space) and covalent (through-bond) contributions to couplings involving the CO and C—N vibrational stretching modes of the amide group in the α-helix and the parallel and...
The origin of vibrational mode couplings in various secondary structural motifs of polypeptides
Electrostatic (through-space) and covalent (through-bond) contributions to couplings involving the CO and C—N vibrational stretching modes of the amide group in the α-helix and the parallel and...