An overview of Miranda

Turner, David A.

doi:10.1145/15042.15053

Cited by 161 publications

(60 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To ensure uniqueness of reduction, we require that each function in a program have at most one definition and, in the case of a g-definition, that no two patterns Pi and pj contain the same constructor. The semantics for reduction of a variable-free term is call-by-name, as realized in Miranda [Tur90] by "lazy evaluation." Apart from the fact that the language is first-order there are two obvious and quite common restrictions: function definitions may have at most one pattern matching argument, and only non-nested patterns.…”

Section: Languagementioning

confidence: 99%

Towards unifying partial evaluation, deforestation, supercompilation, and GPC

Sørensen

Glück

Jones

1994

Programming Languages and Systems — ESOP '94

View full text Add to dashboard Cite

Abstract. We study four transformation methodologies which are automatic instances of Burstall and Darfington's fold/unfold framework:partial evaluation, deforestation, supercompilation, and generalized partial computation (GPC). One can classify these and other fold/unfold based transformers by how much information they maintain during transformation.We introduce the positive supercompiler, a version of deforestation including more information propagation, to study such a classification in detail. Via the study of positive supercompilation we are able to show that partial evaluation and deforestation have simple information propagation, positive supercompflation has more information propagation, and supercompflation and GPC have even more information propagation. The amount of information propagation is significant: positive supercompilation, GPC, and supercompflation can specialize a general pattern matcher to a fixed pattern so as to obtain efficient output similar to that of the Knuth-Morris-Pratt algorithm. In the case of partial evaluation and deforestation, the genera] matcher must be rewritten to ~chieve this.

show abstract

Section: Languagementioning

confidence: 99%

Towards unifying partial evaluation, deforestation, supercompilation, and GPC

Sørensen

Glück

Jones

1994

Programming Languages and Systems — ESOP '94

View full text Add to dashboard Cite

show abstract

“…Using this feature of an algebraic function we can define in Flang constructors with constraints, for instance, the constructor of an ordered list. Let The idea of an algebraic function plays in Flang about the same role as the idea of an unfree algebra (an algebraic data type with associated laws) in D.Turner's Miranda [7]. But the concept of an algebraic function seems to be closer to the kernel of Flang than Unfree algebras to the kernel of Miranda.…”

Section: Flang Contains Two Main Types Of Functionsmentioning

confidence: 99%

“…The problem of the efficient implementation of functional and logic languages draws the attention of many computer scientists [2,[4][5][6][7][8]. Our general approach of compilation is close to approaches of Aquarius Prolog [5] and Parma [6].…”

Section: Introductionmentioning

confidence: 99%

Compiling flang

Mantsivoda¹,

Petukhin²

1992

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The problems of compilation of a functional-logic language Flang axe considered. A new phase of compilation -global dataflow analysis -is discussed. It is shown that this phase can extremely improve the performance of a produced code. For some benchmarks a code which is produced by the Flang compiler has about the same speed as the speed of corresponding Pascal programs. IntroductionIn this paper we consider the main aspects of implementation of a functional-logic lan- s optimizations for parameters management of a functional style;• implementation of a special technique for algebraic computations;• a support of a constraint satisfaction technique [3];• additional instructions to support special tools (e.g. conditional expressions);The Flang compilation process consists of four principal stages. The first phase is translation of a Flang source program into some simplified form. After this, the compiler fulfills very significant and quite new step --the global dataflow analysis of a program.

show abstract

“…vc ca.. strict the polymorphism of arguments and results of functions in certain ways so that we are still able to decidably infer their type using known algorithms. The most popular approach, taken by many modern languages such as ML [24,25,41,42], Miranda [60,61], Hope [14], Haskell [27] and Id, is to use a special polymorphic type inference system now commonly referred to as the Hindley/Milner type system [20,26,40].…”

Section: Higher-order Functionsmentioning

confidence: 99%

An Incremental Type Inference System for the Programming Language Id

Gupta¹

1990

View full text Add to dashboard Cite

An overview of Miranda

Cited by 161 publications

References 2 publications

Towards unifying partial evaluation, deforestation, supercompilation, and GPC

Towards unifying partial evaluation, deforestation, supercompilation, and GPC

Compiling flang

An Incremental Type Inference System for the Programming Language Id

Contact Info

Product

Resources

About