Miranda
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Functorial polymorphism
- Orthogonal parallel processing in Vector Pascal
- More efficient left-to-right matching for overlapping pattern
- scientific article; zbMATH DE number 177788 (Why is no real title available?)
- Dynamic tabbing for automatic indentation with the layout rule
- Principal types and unification for simple intersection type systems
- scientific article; zbMATH DE number 1456971 (Why is no real title available?)
- scientific article; zbMATH DE number 555217 (Why is no real title available?)
- Programming by numbers: A programming method for novices
- Implementing first-order rewriting with constructor systems
- scientific article; zbMATH DE number 177260 (Why is no real title available?)
- scientific article; zbMATH DE number 1638665 (Why is no real title available?)
- scientific article; zbMATH DE number 4043233 (Why is no real title available?)
- Towards the formal specification and verification of Maple programs
- Complete restrictions of the intersection type discipline
- scientific article; zbMATH DE number 1086682 (Why is no real title available?)
- Formal specification of topological subdivisions using hypermaps
- Universal algebra in higher types
- A note on higher-order functions versus logical variables
- scientific article; zbMATH DE number 1949659 (Why is no real title available?)
- Functional semantics
- scientific article; zbMATH DE number 1235907 (Why is no real title available?)
- Interval propagation to reason about sets: Definition and implementation of a practical language
- scientific article; zbMATH DE number 48833 (Why is no real title available?)
- scientific article; zbMATH DE number 48611 (Why is no real title available?)
- scientific article; zbMATH DE number 49798 (Why is no real title available?)
- scientific article; zbMATH DE number 4176423 (Why is no real title available?)
- scientific article; zbMATH DE number 1964952 (Why is no real title available?)
- Lazy productivity via termination
- The complexity of type inference for higher-order typed lambda calculi
- SOS formats and meta-theory: 20 years after
- The integration of functions into logic programming: From theory to practice
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
- scientific article; zbMATH DE number 4050952 (Why is no real title available?)
- Computational interpretations of linear logic
- scientific article; zbMATH DE number 50753 (Why is no real title available?)
- scientific article; zbMATH DE number 1678377 (Why is no real title available?)
- scientific article; zbMATH DE number 4037164 (Why is no real title available?)
- Transfinite reductions in orthogonal term rewriting systems
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Full abstraction and limiting completeness in equational languages
- Using lazy evaluation to simulate realistic-size repertoires in models of the immune system
- scientific article; zbMATH DE number 970727 (Why is no real title available?)
- An approach to object semantics based on terminal co-algebras
- Head boundedness of nonterminating rewritings
- Efficient graph rewriting and its implementation
- Logic programming with functions and predicates: The language Babel
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- scientific article; zbMATH DE number 516984 (Why is no real title available?)
- Typability and type checking in System F are equivalent and undecidable
- An efficient algorithm for cyclic reference counting.
- Logic and Computation
- A domain-theoretic approach to functional and logic programming
- scientific article; zbMATH DE number 177790 (Why is no real title available?)
- scientific article; zbMATH DE number 2080952 (Why is no real title available?)
- Deforestation: Transforming programs to eliminate trees
- scientific article; zbMATH DE number 4024773 (Why is no real title available?)
- Generalization of final algebra semantics by relativization
- A chemical abstract machine for graph reduction extended abstract
- scientific article; zbMATH DE number 1638668 (Why is no real title available?)
- scientific article; zbMATH DE number 4014001 (Why is no real title available?)
- scientific article; zbMATH DE number 177826 (Why is no real title available?)
- The Theory of Calculi with Explicit Substitutions Revisited
- Axioms for strict and lazy functional programs
- Quantifier elimination and parametric polymorphism in programming languages
- Kahn networks at the dawn of functional programming
- Defining, analysing and implementing communication protocols using attribute grammars
- scientific article; zbMATH DE number 1708150 (Why is no real title available?)
- Full abstraction in the lazy lambda calculus
- Transfinite reductions in orthogonal term rewriting systems
- Functional description of the contextual analysis in block-structured programming languages: A case study of tree transducers
- APL
- ML
- Modula
- CLEAN
- ObjectCurry
- PROOF
- ISDL
- OBSCURE
- DACTL
- BABEL
- FORTH
- CLOS
- POOL
- Haskell
- LETOS
- LISP
- Alfalfa
- GUM
- iTasks
- Jambox
- Scheme
- Naira
- Sisal
- SmallEiffel
- MiniMaple
- Ariel
- Caliban
- Clio
- FaCiLe
This page was built for software: Miranda
