Haskell - MaRDI portal

Cited in

(only showing first 100 items - show all)

Quick specifications for the busy programmer
scientific article; zbMATH DE number 1954121 (Why is no real title available?)
Programs using syntax with first-class binders
scientific article; zbMATH DE number 2156365 (Why is no real title available?)
Plethysms of symmetric functions and representations of \(\mathrm{SL}_2(\mathbf{C})\)
Implementation of Functional Languages
Simplifying regular expressions further
iRho: an imperative rewriting calculus
Structuring quantum effects: superoperators as arrows
Context-free session type inference
Factorising folds for faster functions
Measure transformer semantics for Bayesian machine learning
Generic Programming
Enclosing the behavior of a hybrid automaton up to and beyond a Zeno point
Domain-specific languages of mathematics
On the bright side of type classes: instance arguments in Agda
Is genome written in Haskell?
scientific article; zbMATH DE number 2086600 (Why is no real title available?)
Access control in a core calculus of dependency
Type-directed specialization of polymorphism.
More efficient left-to-right matching for overlapping pattern
Turning Inductive into Equational Specifications
Direct modular evaluation of expressions using the monads and type classes in Haskell
scientific article; zbMATH DE number 2088359 (Why is no real title available?)
Synthesis of Mealy machines using derivatives
Associated types with class
Algorithm design with Haskell
Functional programming through deep time: modeling the first complex ecosystems on earth
Type system in programming languages
Libraries for generic programming in Haskell
An extended comparative study of language support for generic programming
Propositional lax logic
Parallel functional programming in Eden
Warnings for pattern matching
Computer Algebra with SymbolicC++
Categorical ML -- category-theoretic modular programming
Sequences, Obligations, and the Contrary-to-Duty Paradox
A Haskell implementation of an attack on Dömösi's cryptosystem
PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control
APLicative Programming with Naperian Functors
Automatic Generation of Test Inputs for Mercury
Hints in Unification
Hyperbolic graphs of small complexity
Implementing hybrid semantics: from functional to imperative
Emulating primality with multiset representations of natural numbers
Unguarded recursion on coinductive resumptions
A language for generic programming in the large
From natural semantics to C: A formal derivation of two STG machines
Arrows for secure information flow
2000 ACM SIGPLAN Haskell workshop (satellite event of PLI 2000), Montreal, Canada, September 17, 2000. Proceedings
Computing in unpredictable environments: semantics, reduction strategies, and program transformations
Synthetic tableaux: Minimal tableau search heuristics
Covariant types
Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation
High-level modelling for typed functional programming
Leveraging the information contained in theory presentations
Conservative concurrency in Haskell
Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers
Iterated covariant powerset is not a monad
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
Haskell before Haskell: an alternative lesson in practical logics of the ENIAC
Practical synthesis of reactive systems from LTL specifications via parity games
scientific article; zbMATH DE number 2247254 (Why is no real title available?)
scientific article; zbMATH DE number 1951572 (Why is no real title available?)
Statistical properties of lambda terms
Harnessing the multicores: nested data parallelism in Haskell
Dependent Types at Work
Relationships between category theory and functional programming with an application
Dependent types and program equivalence
On termination, confluence and consistent CHR-based type inference
Principled parsing for indentation-sensitive languages, revisiting Landin's offside rule
Higher-order unification, polymorphism, and subsorts
Attribute grammars fly first-class: how to do aspect oriented programming in Haskell
Equational formulas and pattern operations in initial order-sorted algebras
Proof search in a context-sensitive logic for molecular biology
A constructive algorithm for finding the exact roots of polynomials with computable real coefficients.
The generic approximation lemma
Open and closed scopes for constrained genericity
Higher-ranked annotation polymorphic dependency analysis
Probabilistic programming language and its incremental evaluation
Adaptable software -- modular extensible monadic entry-pointless type checker in Haskell
Composable scheduler activations for Haskell
A theory of core fudgets
Extended Static Checking by Calculation Using the Pointfree Transform
Handlers in action
scientific article; zbMATH DE number 29052 (Why is no real title available?)
On a machine-checked proof for fraction arithmetic over a GCD domain
Implementation of Functional Languages
Rewriting with generalized nominal unification
A functional, successor list based version of Warshall's algorithm with applications
View-based propagator derivation
On the semantics of parsing actions
A greedy approach for a rolling stock management problem using multi-interval constraint propagation. A greedy approach for a rolling stock management problem using multi-interval constraint propagation, ROADEF/EURO challenge 2014
Executable component-based semantics
Simple rectangle-based functional programs for computing reflexive-transitive closures
The worker/wrapper transformation
Theoretical Aspects of Computing – ICTAC 2005
Manipulating accumulative functions by swapping call-time and return-time computations
Refactoring tools for functional languages
Component support in PLT scheme

This page was built for software: Haskell