Haskell
From MaRDI portal
Software:16052
swMATH3521WikidataQ34010MaRDI QIDQ16052
No author found.
Related Items (only showing first 100 items - show all)
Bounded quantifications for iteration and concurrency in logic programming ⋮ Simplifying regular expressions further ⋮ Observationally-induced algebras in domain theory ⋮ Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation ⋮ High-level modelling for typed functional programming ⋮ ``Keep definition, change category -- a practical approach to state-based system calculi ⋮ Probabilistic modelling, inference and learning using logical theories ⋮ 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 ⋮ Expressible sharing for functional circuit description ⋮ A principled approach to programming with nested types in Haskell ⋮ Dynamic state restoration using versioning exceptions ⋮ Polymorphic typed defunctionalization and concretization ⋮ Explicit substitutions and higher-order syntax ⋮ Transposing partial components--an exercise on coalgebraic refinement ⋮ Programming languages and systems. 15th European symposium on programming, ESOP 2006, held as part of the joint European conferences on theory and practice of software, ETAPS 2006, Vienna, Austria, March 27--28, 2006. Proceedings. ⋮ Proving termination of context-sensitive rewriting by transformation ⋮ Type checking a multithreaded functional language with session types ⋮ Dependency pairs for proving termination properties of conditional term rewriting systems ⋮ SAD as a mathematical assistant -- how should we go from here to there? ⋮ Generalising the array split obfuscation ⋮ Customizing an XML-Haskell data binding with type isomorphism inference in generic Haskell ⋮ Costing stepwise refinements of parallel programs ⋮ Proceedings of the programming languages meets program verification (PLPV 2006), Seattle, WA, USA, August 21, 2006 ⋮ Verification of FPGA layout generators in higher-order logic ⋮ Mechanizing and improving dependency pairs ⋮ Imperative abstractions for functional actions ⋮ Proceedings of the 15th workshop on functional and (constraint) logic programming (WFLP 2006), Madrid, Spain, November 16--17, 2006 ⋮ Flow analysis of lazy higher-order functional programs ⋮ Preventing injection attacks with syntax embeddings ⋮ Constructing language processors with algebra combinators ⋮ Simple and safe SQL queries with \texttt{C++} templates ⋮ Proceedings of the 4th international workshop on quantum programming languages (QPL 2006), Oxford, UK, 17--19 July 2006 ⋮ Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition ⋮ Semantic types and approximation for Featherweight Java ⋮ Infinitary rewriting: meta-theory and convergence ⋮ The language of social software ⋮ An algorithm for generating a family of alternating knots ⋮ Specifying rewrite strategies for interactive exercises ⋮ Cartesian effect categories are Freyd-categories ⋮ A functional framework for agent-based models of exchange ⋮ Pointfree expression and calculation: From quantification to temporal logic ⋮ A Church-style intermediate language for ML\(^{\text F}\) ⋮ Extracting the resolution algorithm from a completeness proof for the propositional calculus ⋮ A logic for Miranda ⋮ Coalgebras in functional programming and type theory ⋮ Deadlock checking by a behavioral effect system for lock handling ⋮ Core FOBS: A hybrid functional and object-oriented language ⋮ The saga of minimum spanning trees ⋮ Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation ⋮ Binary trees as a computational framework ⋮ Generic programming in 3D ⋮ A formal model of a system for automated program parallelization ⋮ On theorem prover-based testing ⋮ Keeping calm in the face of change. Towards optimisation of FRP by reasoning about change ⋮ A lean specification for gadts: System F with first-class equality proofs ⋮ 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 ⋮ Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations ⋮ Categorical ML -- category-theoretic modular programming ⋮ Computational interpretations of linear logic ⋮ Polynomial-time inverse computation for accumulative functions with multiple data traversals ⋮ The interaction of contracts and laziness ⋮ Graph-based communication in Eden ⋮ Graphical and incremental type inference. A graph transformation approach ⋮ A language for generic programming in the large ⋮ Proofs, programs, processes ⋮ Arrows for secure information flow ⋮ A denotational semantics for Handel-C ⋮ Termination of narrowing via termination of rewriting ⋮ Polymorphic subtyping in O'Haskell ⋮ Lazy productivity via termination ⋮ A generic complete dynamic logic for reasoning about purity and effects ⋮ Mathematics of program construction. 7th international conference, MPC 2004, Stirling, Scotland, UK, July 12--14, 2004. Proceedings. ⋮ The world's shortest correct exact real arithmetic program? ⋮ 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 ⋮ Context-sensitive dependency pairs ⋮ Implementing a computer algebra system in Haskell ⋮ An update calculus for expressing type-safe program updates ⋮ HasCasl: integrated higher-order specification and program development ⋮ A family of syntactic logical relations for the semantics of Haskell-like languages ⋮ Recasting ML\(^{\text F}\) ⋮ Winskel is (almost) right: Towards a mechanized semantics textbook ⋮ Functional-logic integration via minimal reciprocal extensions ⋮ Deterministic second-order patterns ⋮ Nesting forward-mode AD in a functional framework ⋮ Refined typing to localize the impact of forced strictness on free theorems ⋮ Termination of narrowing revisited ⋮ On the algebraic structure of declarative programming languages ⋮ Operating system verification---an overview ⋮ Operational termination of conditional term rewriting systems ⋮ Leveraging compiler intermediate representation for multi- and cross-language verification ⋮ Typability and type checking in System F are equivalent and undecidable ⋮ A co-induction principle for recursively defined domains ⋮ A distributed functional framework for recursive finite element simulations ⋮ Enclosing the behavior of a hybrid automaton up to and beyond a Zeno point
This page was built for software: Haskell
