Results 1  10
of
884
Minimally Strict Polymorphic Functions
"... In this paper we show how to efficiently check whether a polymorphic function is minimally strict. A function is minimally strict if it is the minimal element of a specific lessstrict ordering. We prove that we can check whether two polymorphic functions are related by the lessstrict ordering by e ..."
Abstract
 Add to MetaCart
In this paper we show how to efficiently check whether a polymorphic function is minimally strict. A function is minimally strict if it is the minimal element of a specific lessstrict ordering. We prove that we can check whether two polymorphic functions are related by the lessstrict ordering
Convergence Properties of the NelderMead Simplex Method in Low Dimensions
 SIAM Journal of Optimization
, 1998
"... Abstract. The Nelder–Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional unconstrained minimization. Despite its widespread use, essentially no theoretical results have been proved explicitly for the Nelder–Mead algorithm. This paper pr ..."
Abstract

Cited by 598 (3 self)
 Add to MetaCart
presents convergence properties of the Nelder–Mead algorithm applied to strictly convex functions in dimensions 1 and 2. We prove convergence to a minimizer for dimension 1, and various limited convergence results for dimension 2. A counterexample of McKinnon gives a family of strictly convex functions
Pizza into Java: Translating theory into practice
 In Proc. 24th ACM Symposium on Principles of Programming Languages
, 1997
"... Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higherorder functions, and algebraic data types. Pizza attempts to make these ideas accessible by translating them into Java. We mean that both figuratively and literally, because ..."
Abstract

Cited by 336 (15 self)
 Add to MetaCart
Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higherorder functions, and algebraic data types. Pizza attempts to make these ideas accessible by translating them into Java. We mean that both figuratively and literally, because
Functional Data Structures
, 1996
"... this paper. Note that the cons operation supplied by this library is strict, not lazy. In fact, the only lazy operations in this library are ++ (infix append) and reverse. 2 FIFO Queues Stacks and queues are usually the first two data structures studied by beginning computer science students. The ty ..."
Abstract

Cited by 283 (4 self)
 Add to MetaCart
the simplest example of a data structure whose implementation in a functional setting is substantially different from its implementation in an imperative setting. For this reason, functional queues have been widely studied [11, 9, 3, 23, 24]. A minimal signature for queues appears in Figure 2. The three main
The geometry of optimal transportation
 Acta Math
, 1996
"... A classical problem of transporting mass due to Monge and Kantorovich is solved. Given measures µ and ν on R d, we find the measurepreserving map y(x) between them with minimal cost — where cost is measured against h(x − y) withhstrictly convex, or a strictly concave function of x − y. This map i ..."
Abstract

Cited by 240 (33 self)
 Add to MetaCart
A classical problem of transporting mass due to Monge and Kantorovich is solved. Given measures µ and ν on R d, we find the measurepreserving map y(x) between them with minimal cost — where cost is measured against h(x − y) withhstrictly convex, or a strictly concave function of x − y. This map
Containers  Constructing Strictly Positive Types
, 2004
"... ... with disjoint coproducts and initial algebras of container functors (the categorical analogue of Wtypes) — and then establish that nested strictly positive inductive and coinductive types, which we call strictly positive types, exist in any MartinLöf category. Central to our development are t ..."
Abstract

Cited by 83 (28 self)
 Add to MetaCart
that morphisms between containers can be full and faithfully interpreted as polymorphic functions (i.e. natural transformations) and that, in the presence of Wtypes, all strictly positive types (including nested inductive and coinductive types) give rise to containers.
Inference of Polymorphic and Conditional Strictness Properties
 IN CONF. REC. POPL ’98: 25TH ACM SYMP. PRINC. OF PROG. LANGS
, 1998
"... We define an inference system for modular strictness analysis of functional programs by extending a conjunctive strictness logic with polymorphic and conditional properties. This extended set of properties is used to define a syntaxdirected, polymorphic strictness analysis based on polymorphic recu ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
We define an inference system for modular strictness analysis of functional programs by extending a conjunctive strictness logic with polymorphic and conditional properties. This extended set of properties is used to define a syntaxdirected, polymorphic strictness analysis based on polymorphic
Polymorphic Strictness Analysis Using Frontiers
 Proceedings of the 1993 ACM on Partial Evaluation and SemanticsBased Program Manipulation (PEPM '93), ACM
, 1992
"... This paper shows how to implement sensible polymorphic strictness analysis using the Frontiers algorithm. A central notion is to only ever analyse each function once, at its simplest polymorphic instance. Subsequent nonbase uses of functions are dealt with by generalising their simplest instance an ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
This paper shows how to implement sensible polymorphic strictness analysis using the Frontiers algorithm. A central notion is to only ever analyse each function once, at its simplest polymorphic instance. Subsequent nonbase uses of functions are dealt with by generalising their simplest instance
Nonuniqueness of minimizers for strictly polyconvex functionals
 Mathematischnaturwissenschaftliche Fakultät Universität Zürich Preprint 15
, 2007
"... In this note we solve a problem posed by J. M. Ball in [2] about the uniqueness of smooth equilibrium solutions to boundary value problems for strictly polyconvex functionals, F(u) = f(∇u(x)) dx and u∂Ω = u0, Ω where Ω is homeomorphic to a ball. We give several examples of nonuniqueness. The main ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this note we solve a problem posed by J. M. Ball in [2] about the uniqueness of smooth equilibrium solutions to boundary value problems for strictly polyconvex functionals, F(u) = f(∇u(x)) dx and u∂Ω = u0, Ω where Ω is homeomorphic to a ball. We give several examples of non
Strictness Analysis of Lazy Functional Programs
, 1992
"... Strictness analysis is a compiletime analysis for lazy functional languages. The information gained by a strictness analyser can be used to improve code generation for both sequential and parallel implementations of such languages. After reviewing the syntax and semantics of a simply typed lambda c ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
Strictness analysis is a compiletime analysis for lazy functional languages. The information gained by a strictness analyser can be used to improve code generation for both sequential and parallel implementations of such languages. After reviewing the syntax and semantics of a simply typed lambda
Results 1  10
of
884