Haskell

swMATH3521WikidataQ34010 ScholiaQ34010MaRDI QIDQ16052FDOQ16052

Author name not available (Why is that?)

Described by source

• Programming in Haskell
• Programming in Haskell
• Unnamed Publication

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

• Synthesis of Mealy machines using derivatives
• Computer Algebra with SymbolicC++
• Sequences, Obligations, and the Contrary-to-Duty Paradox
• Propositional lax logic
• Extended Static Checking by Calculation Using the Pointfree Transform
• Operational aspects of untyped Normalisation by Evaluation
• A programmable editor for developing structured documents based on bidirectional transformations
• Proving operational termination of membership equational programs
• \textsc{OutsideIn(X)}: modular type inference with local assumptions
• Higher-order functions for parsing
• An algorithm for generating a family of alternating knots
• Comparing parallel functional languages: Programming and performance
• Rewriting strategies and strategic rewrite programs
• Computational semantics with functional programming
• An overview of QML with a concrete implementation in Haskell
• Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types
• A functional framework for agent-based models of exchange
• A Church-style intermediate language for ML\(^{\text F}\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Delimited dynamic binding
• Termination Analysis by Dependency Pairs and Inductive Theorem Proving
• Attribute grammars as recursion schemes over cyclic representations of zippers
• Applicative bidirectional programming with lenses
• On building cyclic and shared structures in Haskell
• Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism
• Kleene monads: handling iteration in a framework of generic effects
• Recasting ML\(^{\text F}\)
• System FC with explicit kind equality
• Dependently-typed formalisation of relation-algebraic abstractions
• Optimistic evaluation
• Finding linear dependencies in integration-by-parts equations: a Monte Carlo approach
• A play on regular expressions: functional pearl
• The saga of minimum spanning trees
• Binary trees as a computational framework
• Title not available (Why is that?)
• Proof-producing synthesis of ML from higher-order logic
• On theorem prover-based testing
• Automated Reasoning
• A monadic semantics for core Curry
• A survey of strategies in rule-based program transformation systems
• Functional reactive animation
• Local Termination
• Formalisation in higher-order logic and code generation to functional languages of the Gauss-Jordan algorithm
• Deadlock checking by a behavioral effect system for lock handling
• Typed Contracts for Functional Programming
• FUNCTIONAL PEARL Derivation of a logarithmic time carry lookahead addition circuit
• A debugging system based on natural semantics
• A Polymorphic Type System for the Lambda-Calculus with Constructors
• Searching for deadlocks while debugging Concurrent Haskell programs
• Operating system verification---an overview
• Generating power of lazy semantics
• Dependency pairs for proving termination properties of conditional term rewriting systems
• Enhancing semantic bidirectionalization via shape bidirectionalizer plug-ins
• Winskel is (almost) right: Towards a mechanized semantics textbook
• Proceedings of the 15th workshop on functional and (constraint) logic programming (WFLP 2006), Madrid, Spain, November 16--17, 2006
• Compilation of extended recursion in call-by-value functional languages
• Extended term rewriting systems
• Specification and verification challenges for sequential object-oriented programs
• Qualified types for MLF
• Sequent calculus as a compiler intermediate language
• Mechanizing and improving dependency pairs
• Traced Premonoidal Categories
• Context-sensitive dependency pairs
• Operational termination of conditional term rewriting systems
• Title not available (Why is that?)
• Implementing Gröbner bases for operads
• Code generation via higher-order rewrite systems
• Proceedings of the programming languages meets program verification (PLPV 2006), Seattle, WA, USA, August 21, 2006
• Proceedings of the 4th international workshop on quantum programming languages (QPL 2006), Oxford, UK, 17--19 July 2006
• Context-sensitive rewriting strategies
• Title not available (Why is that?)
• Static contract checking for Haskell
• Cartesian effect categories are Freyd-categories
• Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition
• Semantic types and approximation for Featherweight Java
• Congruence closure of compressed terms in polynomial time
• Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
• Descendants and origins in term rewriting.
• A Hoare Logic for the State Monad
• Graph-based communication in Eden
• Graphical and incremental type inference. A graph transformation approach
• Polynomial-time inverse computation for accumulative functions with multiple data traversals
• The interaction of contracts and laziness
• Title not available (Why is that?)
• Enclosing the behavior of a hybrid automaton up to and beyond a Zeno point
• Implementing hybrid semantics: from functional to imperative
• Title not available (Why is that?)
• Dependent Types at Work
• Haskell before Haskell: an alternative lesson in practical logics of the ENIAC
• Practical synthesis of reactive systems from LTL specifications via parity games
• A theory of core fudgets
• Handlers in action
• Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers
• On a machine-checked proof for fraction arithmetic over a GCD domain
• Semantic essence of AsmL
• Title not available (Why is that?)
• Title not available (Why is that?)
• Observationally-induced algebras in domain theory
• Observationally-induced algebras in domain theory

This page was built for software: Haskell