scientific article; zbMATH DE number 1952947

No author found.

Publication date: 24 July 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Haskell functional programming Haskell 98 Language and libraries

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Related Items

Observationally-induced algebras in domain theory ⋮ Kleene Monads: Handling Iteration in a Framework of Generic Effects ⋮ Let’s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract) ⋮ Proving Properties about Functions on Lists Involving Element Tests ⋮ Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation ⋮ Algebraic-coalgebraic specification in CoCASL ⋮ Transforming Boolean equalities into constraints ⋮ Short variable length domain extenders with beyond birthday bound security ⋮ Finding linear dependencies in integration-by-parts equations: a Monte Carlo approach ⋮ Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers ⋮ Compilation of extended recursion in call-by-value functional languages ⋮ A principled approach to programming with nested types in Haskell ⋮ A Hoare Logic for the State Monad ⋮ Certification of Termination Proofs Using CeTA ⋮ Generalized Theoroidal Institution Comorphisms ⋮ Sorted ⋮ Explicit substitutions and higher-order syntax ⋮ Generalising the array split obfuscation ⋮ Plethysms of symmetric functions and representations of \(\mathrm{SL}_2(\mathbf{C})\) ⋮ Costing stepwise refinements of parallel programs ⋮ Imperative abstractions for functional actions ⋮ Auto in Agda ⋮ Constructing language processors with algebra combinators ⋮ Simple and safe SQL queries with \texttt{C++} templates ⋮ Deaccumulation techniques for improving provability ⋮ Rewriting Strategies and Strategic Rewrite Programs ⋮ More dependent types for distributed arrays ⋮ A functional approach to generic programming using adaptive traversals ⋮ A coinductive calculus for asynchronous side-effecting processes ⋮ Lazy Relations ⋮ Default rules for Curry ⋮ Specifying rewrite strategies for interactive exercises ⋮ A functional framework for agent-based models of exchange ⋮ A Church-style intermediate language for ML\(^{\text F}\) ⋮ SAC -- a functional array language for efficient multi-threaded execution ⋮ iRho: an imperative rewriting calculus ⋮ A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations ⋮ Safety of Nöcker's strictness analysis ⋮ State separation for code-based game-playing proofs ⋮ A generalized SXP rule proved by bijections and involutions ⋮ Core FOBS: A hybrid functional and object-oriented language ⋮ Accommodative Belief Revision ⋮ The saga of minimum spanning trees ⋮ Generic programming in 3D ⋮ Making ``stricterness more relevant ⋮ Generic multiset programming with discrimination-based joins and symbolic Cartesian products ⋮ Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types ⋮ A Type of Partial Recursive Functions ⋮ Strategic port graph rewriting: an interactive modelling framework ⋮ Hoare type theory, polymorphism and separation ⋮ Operational semantics for declarative multi-paradigm languages ⋮ Transforming Functional Logic Programs into Monadic Functional Programs ⋮ Selective strictness and parametricity in structural operational semantics, inequationally ⋮ Complete Elgot monads and coalgebraic resumptions ⋮ Combining deep and shallow embedding of domain-specific languages ⋮ Algorithmic analysis of polygonal hybrid systems. II: Phase portrait and tools ⋮ NixOS: A purely functional Linux distribution ⋮ Functional Logic Programming: From Theory to Curry ⋮ The interaction of contracts and laziness ⋮ A short cut to optimal sequences ⋮ Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code ⋮ A language for generic programming in the large ⋮ Modules over monads and initial semantics ⋮ Lazy productivity via termination ⋮ A generic complete dynamic logic for reasoning about purity and effects ⋮ Implementing Data Parallel Rational Multiple-Residue Arithmetic in Eden ⋮ On modularity in infinitary term rewriting ⋮ Dynamic slicing of lazy functional programs based on redex trails ⋮ Real number computation with committed choice logic programming languages ⋮ A compact fixpoint semantics for term rewriting systems ⋮ Type-directed weaving of aspects for polymorphically typed functional languages ⋮ Type inference and strong static type checking for Promela ⋮ Second-Order Programs with Preconditions ⋮ Type Fusion ⋮ The worker/wrapper transformation ⋮ Factorising folds for faster functions ⋮ Another Look at Function Domains ⋮ HasCasl: integrated higher-order specification and program development ⋮ Unnamed Item ⋮ A family of syntactic logical relations for the semantics of Haskell-like languages ⋮ A Coinductive Calculus for Asynchronous Side-Effecting Processes ⋮ Haskell ⋮ Canonical Forms in Interactive Exercise Assistants ⋮ The essence of the <scp>Iterator</scp> pattern ⋮ Categorical semantics for arrows ⋮ CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates ⋮ Continuous reformulations and heuristics for the Euclidean travelling salesperson problem ⋮ CoLoSS: The Coalgebraic Logic Satisfiability Solver ⋮ Refined typing to localize the impact of forced strictness on free theorems ⋮ Termination of narrowing revisited ⋮ On the algebraic structure of declarative programming languages ⋮ Symmetric matroid polytopes and their generation ⋮ View-based propagator derivation ⋮ Modelling Adaptive Systems in ForSyDe ⋮ Language-Based Program Verification via Expressive Types ⋮ Using Maude and Its Strategies for Defining a Framework for Analyzing Eden Semantics ⋮ Merging Hierarchically-Structured Documents in Workflow Systems ⋮ Reporting Failures in Functional Logic Programs ⋮ A Framework for Interpreting Traces of Functional Logic Computations ⋮ Implementing Relational Specifications in a Constraint Functional Logic Language ⋮ Linear Dependent Type Theory for Quantum Programming Languages ⋮ Deep embedding with class ⋮ Permutation groups containing a regular abelian subgroup: the tangled history of two mistakes of Burnside ⋮ Counting and generating terms in the binary lambda calculus ⋮ Unguarded recursion on coinductive resumptions ⋮ Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) ⋮ Rewriting with generalized nominal unification ⋮ Manipulating accumulative functions by swapping call-time and return-time computations ⋮ Declarative Debugging Meets the World ⋮ A Duality of Sorts ⋮ Modularity and Implementation of Mathematical Operational Semantics ⋮ A Transformational Approach to Prove Outermost Termination Automatically ⋮ Recognizing Strategies ⋮ To be or not to be …lazy (In a Parallel Context) ⋮ Partiality and recursion in interactive theorem provers – an overview ⋮ From Boolean Equalities to Constraints ⋮ A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi ⋮ Applicative programming with effects ⋮ Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism ⋮ Ott: Effective tool support for the working semanticist ⋮ Dependent Types at Work ⋮ Extended Static Checking by Calculation Using the Pointfree Transform ⋮ Combinator Parsing: A Short Tutorial ⋮ Deciding inclusion of set constants over infinite non-strict data structures ⋮ Translating between Language and Logic: What Is Easy and What Is Difficult ⋮ Interleaving Strategies ⋮ HM(X) type inference is CLP(X) solving ⋮ Rewriting and Call-Time Choice: The HO Case ⋮ Preserving Sharing in the Partial Evaluation of Lazy Functional Programs ⋮ Semantics and Efficient Simulation Algorithms of an Expressive Multilevel Modeling Language