Miranda
Miranda: A non-strict functional language with polymorphic types 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.
Keywords for this software
References in zbMATH (referenced in 140 articles , 1 standard article )
Showing results 1 to 20 of 140.
Sorted by year (- Clerici, Silvia; Zoltan, Cristina; Prestigiacomo, Guillermo: Graphical and incremental type inference. A graph transformation approach (2013)
- Bove, Ana; Dybjer, Peter; Sicard-Ramírez, Andrés: Combining interactive and automatic reasoning in first order theories of functional programs (2012)
- Khan, Muhammad Taimoor; Schreiner, Wolfgang: Towards the formal specification and verification of Maple programs (2012)
- Endrullis, Jörg; Hendriks, Dimitri: Lazy productivity via termination (2011)
- Clerici, Silvia; Zoltan, Cristina; Prestigiacomo, Guillermo: NiMoToons: a totally graphic workbench for program tuning and experimentation (2009) ioport
- MacQueen, David B.: Kahn networks at the dawn of functional programming (2009)
- Kesner, Delia: The theory of calculi with explicit substitutions revisited (2007)
- Mousavi, Mohammadreza; Reniers, Michel A.; Groote, Jan Friso: SOS formats and meta-theory: 20 years after (2007)
- Cockshott, Paul; Michaelson, Greg: Orthogonal parallel processing in Vector Pascal (2006)
- Mousavi, Mohammad Reza; Reniers, Michel A.: Prototyping SOS meta-theory in Maude (2006)
- Glauert, John; Kesner, Delia; Khasidashvili, Zurab: Expression reduction systems and extensions: An overview (2005)
- Nedjah, Nadia; de Macedo Mourelle, Luiza: More efficient left-to-right matching for overlapping pattern (2005)
- Schmidt-Schauß, Manfred; Schulz, Klaus U.: Decidability of bounded higher-order unification (2005)
- Stärk, Robert F.: Axioms for strict and lazy functional programs (2005)
- Cerrito, Serenella; Kesner, Delia: Pattern matching as cut elimination (2004)
- Frost, Richard; Boulos, Pierre: An efficient compositional semantics for natural-language database queries with arbitrarily-nested quantification and negation (2002)
- Heider, Thomas; Kirste, Thomas: Architecture considerations for interoperable multi-modal assistant systems (2002)
- Lins, Rafael Dueire: An efficient algorithm for cyclic reference counting. (2002)
- Nedjah, Nadia; de Macedo Mourelle, Luiza: Minimal adaptive pattern-matching automata for efficient term rewriting (2002)
- Kemp, Graham J.L.; Gray, Peter M.D.; Sjöstedt, Andreas R.: Improving federated database queries using declarative rewrite rules for quantified subqueries (2001)