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)

• Access control in a core calculus of dependency
• Associated types with class
• Parallel functional programming in Eden
• An extended comparative study of language support for generic programming
• A language for generic programming in the large
• Testing from Algebraic Specifications: Test Data Set Selection by Unfolding Axioms
• A denotational semantics for Handel-C
• A Transformational Approach to Prove Outermost Termination Automatically
• Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
• The Impact of the Lambda Calculus in Logic and Computer Science
• Lazy productivity via termination
• Degrees of Undecidability in Term Rewriting
• Flow analysis of lazy higher-order functional programs
• Infinitary rewriting: meta-theory and convergence
• Lightweight static capabilities
• Dynamic optimization for functional reactive programming using generalized algebraic data types
• Scrap more boilerplate
• Operational semantics for multi-language programs
• Haskell overloading is DEXPTIME-complete
• Applicative programming with effects
• Higher-order substitutions
• Safety of Nöcker's strictness analysis
• Hyperbolic Graphs of Small Complexity
• Two-level types and parameterized modules
• Imperative abstractions for functional actions
• Constructing language processors with algebra combinators
• Preventing injection attacks with syntax embeddings
• Simple and safe SQL queries with \texttt{C++} templates
• Libraries for Generic Programming in Haskell
• Verified Characteristic Formulae for CakeML
• Title not available (Why is that?)
• A new notation for arrows
• Recognizing Strategies
• A compact fixpoint semantics for term rewriting systems
• Modularity and Implementation of Mathematical Operational Semantics
• Language-based program verification via expressive types
• Strongly typed rewriting for coupled software transformation
• Associated type synonyms
• Typing dynamic typing
• The language of social software
• Specifying rewrite strategies for interactive exercises
• Modular type classes
• On modularity in infinitary term rewriting
• A principled approach to programming with nested types in Haskell
• Pointfree expression and calculation: From quantification to temporal logic
• Extracting the resolution algorithm from a completeness proof for the propositional calculus
• Coalgebras in functional programming and type theory
• Practical type inference for arbitrary-rank types
• Unifying Theories of Programming with Monads
• Generic Views on Data Types
• Termination of lazy rewriting revisited
• Modular verification of programs with effects and effects handlers
• Principal Type Inference for GHC-Style Multi-parameter Type Classes
• A lean specification for gadts: System F with first-class equality proofs
• Generic multiset programming with discrimination-based joins and symbolic Cartesian products
• Keeping calm in the face of change. Towards optimisation of FRP by reasoning about change
• Making ``stricterness more relevant
• Refined typing to localize the impact of forced strictness on free theorems
• From Outermost Termination to Innermost Termination
• Iteration and coiteration schemes for higher-order and nested datatypes
• Specifying type systems
• Implementation of functional languages. 15th international workshop, IFL 2003, Edinburgh, UK, September 8--11, 2003. Revised papers.
• Call-by-value Solvability
• Tests and Proofs for Enumerative Combinatorics
• A declarative debugging system for lazy functional logic programs
• Code-carrying theories
• Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation
• Modular Verification of Higher-Order Functional Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A short cut to optimal sequences
• Implementation of Functional Languages
• Structuring quantum effects: superoperators as arrows
• Algebraic Specialization of Generic Functions for Recursive Types
• Constraint-aware Schema Transformation
• Generic Programming
• Generic Programming
• Abstract Diagnosis of Functional Programs
• Simplifying regular expressions further
• Hints in Unification
• Categorical ML -- category-theoretic modular programming
• Higher-order unification, polymorphism, and subsorts
• Dependent types and program equivalence
• Implementation of Functional Languages
• Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation
• High-level modelling for typed functional programming
• An Approach to Fast Arrays in Haskell
• A co-induction principle for recursively defined domains
• Proofs, programs, processes
• Polymorphic subtyping in O'Haskell
• Probabilistic modelling, inference and learning using logical theories
• Polymorphic typed defunctionalization and concretization
• The complexity of type inference for higher-order typed lambda calculi
• Expressible sharing for functional circuit description
• Mathematics of program construction. 7th international conference, MPC 2004, Stirling, Scotland, UK, July 12--14, 2004. Proceedings.
• Logic programming in the context of multiparadigm programming: the Oz experience
• Termination of narrowing via termination of rewriting
• Explicit substitutions and higher-order syntax
• Program extraction in exact real arithmetic
• Transfinite reductions in orthogonal term rewriting systems

This page was built for software: Haskell