scientific article; zbMATH DE number 3951980
[For the entire collection see Zbl 0566.00026.] From the introduction: The last few years have seen much fruitful research into the nature of functional programming. Although there are still many important questions unanswered it seems clear that we have reached a point at which it is appropriate to make available what we have found out so far to a larger community, in the form of stable implementations of complete and well-documented programming languages. Miranda is a functional programming language which has been developed with this aim in mind. Given that there are still honest disagreements about some quite fundamental questions amongst researchers in the field, we cannot have a single vehicle. Miranda embodies one set of design decisions. The basic ideas of Miranda are closely modelled on those of the earlier languages SASL and KRC. To arrive at a system more suitable for tackling large problems Miranda adds to this foundation (i) a polymorphic type system and (ii) a library structure with type secure facilities for separate compilation and linking. The major part of this paper will be taken up with a discussion of the type system and in particular the facilities for userdefined types in Miranda, with other aspects of the language and its programming environment being only briefly sketched.
- Adapting combinator and SECD machines to display snapshots of functional computations
- Needed reduction and spine strategies for the lambda calculus
- Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs
- Full abstraction and limiting completeness in equational languages
- Relation algebraic domain constructions
- Booster: A high-level language for portable parallel algorithms
- \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus
- Complete restrictions of the intersection type discipline
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Universal algebra in higher types
- Typability and type checking in System F are equivalent and undecidable
- OBSCURE, a specification language for abstract data types
- Normalization results for typeable rewrite systems
- The application of the functional programming language \textit{Miranda} in the enumeration algorithms of \(k\)-optimal paths
- Miranda
- An efficient algorithm for cyclic reference counting.
- Descendants and origins in term rewriting.
- Pattern matching as cut elimination
- GC\(^{2}\): a generational conservative garbage collector for the ATERM library
- Head boundedness of nonterminating rewritings
- A logic for Miranda, revisited
- Decidability of bounded higher-order unification
- More efficient left-to-right matching for overlapping pattern
- On the efficiency of categorical combinators as a rewriting system
- scientific article; zbMATH DE number 4050952 (Why is no real title available?)
- Higher-order unification with dependent function types
- Transfinite reductions in orthogonal term rewriting systems
- Wrapper semantics of an object-oriented programming language with state
- First order data types and first order logic
- Strictness and totality analysis with conjunction
- Graphical and incremental type inference. A graph transformation approach
- Functional semantics
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
- Extended term rewriting systems
- Generalization of final algebra semantics by relativization
- Categorical semantics for programming languages
- A chemical abstract machine for graph reduction extended abstract
- Folding left and right matters: Direct style, accumulators, and continuations
- Retrieving library identifiers via equational matching of types
- Semantics of non-terminating rewrite systems using minimal coverings
- Describing and animating quantum protocols
- Intersection type assignment systems with higher-order algebraic rewriting
- Computational interpretations of linear logic
- Extensional models for polymorphism
- Functorial polymorphism
- Preliminary arrangements of arguments in lazy evaluation
- An operational semantics for paragon: A design notation for parallel architectures
- Subset-equational programming in intelligent decision systems
- Comparison of priority rules in pattern matching and term rewriting
- SOS formats and meta-theory: 20 years after
- A logic for Miranda
- Cyclic reference counting with local mark-scan
- Implementing term rewrite languages in DACTL
- Equational completion in order-sorted algebras
- Semantics of types for database objects
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3721784)