Miranda

MaRDI QIDQ17133swMATHFDO

Official website http://miranda.org.uk/

Cited in

(only showing first 100 items - show all)

• 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
• Automatic binding time analysis for a typed -calculus
• Implementing first-order rewriting with constructor systems
• Full abstraction and limiting completeness in equational languages
• Relation algebraic domain constructions
• PROOF: A parallel object-oriented functional computation model
• \(Booster\): A high-level language for portable parallel algorithms
• Functional description of the contextual analysis in block-structured programming languages: A case study of tree transducers
• \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus
• Parallel programming with data structures and higher order functions
• 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
• Full abstraction in the lazy lambda calculus
• A note on higher-order functions versus logical variables
• Using lazy evaluation to simulate realistic-size repertoires in models of the immune system
• Typability and type checking in System F are equivalent and undecidable
• OBSCURE, a specification language for abstract data types
• Sequential and data flow models of processing
• Normalization results for typeable rewrite systems
• APL
• ML
• Modula
• CLEAN
• ObjectCurry
• PROOF
• ISDL
• OBSCURE
• DACTL
• FORTH
• BABEL
• POOL
• CLOS
• Haskell
• LETOS
• Axioms for strict and lazy functional programs
• Linear-time hierarchies for a functional language machine model
• Generating function versions with rational strictness patterns
• 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
• Transfinite reductions in orthogonal term rewriting systems
• Head boundedness of nonterminating rewritings
• Efficient graph rewriting and its implementation
• Principal types and unification for simple intersection type systems
• A logic for Miranda, revisited
• Normal forms and conservative extension properties for query languages over collection types
• LISP
• Building a model of a useful Turing machine
• Alfalfa
• iTasks
• GUM
• Jambox
• Decidability of bounded higher-order unification
• Scheme
• Naira
• Sisal
• SmallEiffel
• Orthogonal parallel processing in Vector Pascal
• More efficient left-to-right matching for overlapping pattern
• Programming by numbers: A programming method for novices
• scientific article; zbMATH DE number 1638665 (Why is no real title available?)
• scientific article; zbMATH DE number 1638668 (Why is no real title available?)
• scientific article; zbMATH DE number 1678377 (Why is no real title available?)
• scientific article; zbMATH DE number 1708150 (Why is no real title available?)
• Prototyping SOS meta-theory in Maude
• Combining interactive and automatic reasoning in first order theories of functional programs
• Towards the formal specification and verification of Maple programs
• scientific article; zbMATH DE number 4014001 (Why is no real title available?)
• {log}: A language for programming in logic with finite sets
• MiniMaple
• scientific article; zbMATH DE number 4176423 (Why is no real title available?)
• COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS
• Kahn networks at the dawn of functional programming
• scientific article; zbMATH DE number 4145297 (Why is no real title available?)
• Clio
• Ariel
• Caliban
• The Theory of Calculi with Explicit Substitutions Revisited
• scientific article; zbMATH DE number 3947616 (Why is no real title available?)
• scientific article; zbMATH DE number 4024773 (Why is no real title available?)
• scientific article; zbMATH DE number 4030948 (Why is no real title available?)
• scientific article; zbMATH DE number 4031017 (Why is no real title available?)
• scientific article; zbMATH DE number 4037164 (Why is no real title available?)
• scientific article; zbMATH DE number 4043233 (Why is no real title available?)
• On the efficiency of categorical combinators as a rewriting system
• scientific article; zbMATH DE number 4050952 (Why is no real title available?)
• Logic and Computation
• Logic programming with functions and predicates: The language Babel
• scientific article; zbMATH DE number 48611 (Why is no real title available?)
• scientific article; zbMATH DE number 48833 (Why is no real title available?)
• scientific article; zbMATH DE number 49798 (Why is no real title available?)
• scientific article; zbMATH DE number 50753 (Why is no real title available?)
• scientific article; zbMATH DE number 52915 (Why is no real title available?)
• Constructing Programs as Executable Attribute Grammars
• The Implementation of FDL, a Functional Database Language
• scientific article; zbMATH DE number 108369 (Why is no real title available?)

This page was built for software: Miranda