Miranda

swMATH4986MaRDI QIDQ17133FDOQ17133

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Principal types and unification for simple intersection type systems
• Title not available (Why is that?)
• Implementing first-order rewriting with constructor systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complete restrictions of the intersection type discipline
• Universal algebra in higher types
• Formal specification of topological subdivisions using hypermaps
• Interval propagation to reason about sets: Definition and implementation of a practical language
• The complexity of type inference for higher-order typed lambda calculi
• The integration of functions into logic programming: From theory to practice
• Lazy productivity via termination
• SOS formats and meta-theory: 20 years after
• Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
• Computational interpretations of linear logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Transfinite reductions in orthogonal term rewriting systems
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Title not available (Why is that?)
• Using lazy evaluation to simulate realistic-size repertoires in models of the immune system
• An approach to object semantics based on terminal co-algebras
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Logic programming with functions and predicates: The language Babel
• Logic and Computation
• Typability and type checking in System F are equivalent and undecidable
• Title not available (Why is that?)
• Title not available (Why is that?)
• Deforestation: Transforming programs to eliminate trees
• Title not available (Why is that?)
• The Theory of Calculi with Explicit Substitutions Revisited
• Defining, analysing and implementing communication protocols using attribute grammars
• Full abstraction in the lazy lambda calculus
• Transfinite reductions in orthogonal term rewriting systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Functional description of the contextual analysis in block-structured programming languages: A case study of tree transducers
• Relation algebraic domain constructions
• Title not available (Why is that?)
• An operational semantics for paragon: A design notation for parallel architectures
• Preliminary arrangements of arguments in lazy evaluation
• COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS
• Title not available (Why is that?)
• Title not available (Why is that?)
• Normal forms and conservative extension properties for query languages over collection types
• Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs
• Automatic binding time analysis for a typed \(\lambda\)-calculus
• Pattern matching as cut elimination
• Title not available (Why is that?)
• A logic for Miranda
• Cyclic reference counting with local mark-scan
• Equational completion in order-sorted algebras
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Categories, relations and dynamic programming
• Title not available (Why is that?)
• PROOF: A parallel object-oriented functional computation model
• OBSCURE, a specification language for abstract data types
• Issues in the design of a parallel object-oriented language
• Higher-order unification with dependent function types
• Prototyping SOS meta-theory in Maude
• Subset-equational programming in intelligent decision systems
• Comparison of priority rules in pattern matching and term rewriting
• Needed reduction and spine strategies for the lambda calculus
• Title not available (Why is that?)
• GC\(^{2}\): a generational conservative garbage collector for the ATERM library
• Normalization results for typeable rewrite systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages
• {log}: A language for programming in logic with finite sets
• The Implementation of FDL, a Functional Database Language
• Descendants and origins in term rewriting.
• The lazy z-buffer
• Mapping a functional notation for parallel programs onto hypercubes
• Graphical and incremental type inference. A graph transformation approach
• Functorial polymorphism
• Orthogonal parallel processing in Vector Pascal
• More efficient left-to-right matching for overlapping pattern
• Title not available (Why is that?)
• Dynamic tabbing for automatic indentation with the layout rule
• Title not available (Why is that?)
• Programming by numbers: A programming method for novices
• Title not available (Why is that?)
• Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on higher-order functions versus logical variables
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for software: Miranda