The following pages link to Haskell (Q16052):
Displaying 50 items.
- Enclosing the behavior of a hybrid automaton up to and beyond a Zeno point (Q254170) (← links)
- Observationally-induced algebras in domain theory (Q276418) (← links)
- ``Keep definition, change category'' -- a practical approach to state-based system calculi (Q299180) (← links)
- Finding linear dependencies in integration-by-parts equations: a Monte Carlo approach (Q314201) (← links)
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- Proceedings of the programming languages meets program verification (PLPV 2006), Seattle, WA, USA, August 21, 2006 (Q373632) (← links)
- Proceedings of the 15th workshop on functional and (constraint) logic programming (WFLP 2006), Madrid, Spain, November 16--17, 2006 (Q376392) (← links)
- Proceedings of the 4th international workshop on quantum programming languages (QPL 2006), Oxford, UK, 17--19 July 2006 (Q383298) (← links)
- Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition (Q385017) (← links)
- Semantic types and approximation for Featherweight Java (Q387991) (← links)
- An algorithm for generating a family of alternating knots (Q415783) (← links)
- A functional framework for agent-based models of exchange (Q426933) (← links)
- A Church-style intermediate language for ML\(^{\text F}\) (Q428892) (← links)
- Deadlock checking by a behavioral effect system for lock handling (Q444480) (← links)
- Core FOBS: A hybrid functional and object-oriented language (Q456463) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Binary trees as a computational framework (Q461478) (← links)
- On theorem prover-based testing (Q470025) (← links)
- Polynomial-time inverse computation for accumulative functions with multiple data traversals (Q526439) (← links)
- The interaction of contracts and laziness (Q526445) (← links)
- Graph-based communication in Eden (Q526455) (← links)
- Graphical and incremental type inference. A graph transformation approach (Q526459) (← links)
- A language for generic programming in the large (Q532409) (← links)
- A denotational semantics for Handel-C (Q539165) (← links)
- Lazy productivity via termination (Q549188) (← links)
- Imperative abstractions for functional actions (Q604455) (← links)
- Preventing injection attacks with syntax embeddings (Q608228) (← links)
- Constructing language processors with algebra combinators (Q608238) (← links)
- Simple and safe SQL queries with \texttt{C++} templates (Q608241) (← links)
- The language of social software (Q625718) (← links)
- Specifying rewrite strategies for interactive exercises (Q626940) (← links)
- Cartesian effect categories are Freyd-categories (Q631572) (← links)
- Pointfree expression and calculation: From quantification to temporal logic (Q633283) (← links)
- Extracting the resolution algorithm from a completeness proof for the propositional calculus (Q636273) (← links)
- Coalgebras in functional programming and type theory (Q639643) (← links)
- Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation (Q651316) (← links)
- Keeping calm in the face of change. Towards optimisation of FRP by reasoning about change (Q656853) (← links)
- A lean specification for gadts: System F with first-class equality proofs (Q656862) (← links)
- Making ``stricterness'' more relevant (Q656871) (← links)
- Generic multiset programming with discrimination-based joins and symbolic Cartesian products (Q656874) (← links)
- Categorical ML -- category-theoretic modular programming (Q684395) (← links)
- Computational interpretations of linear logic (Q685430) (← links)
- Proofs, programs, processes (Q693063) (← links)
- Polymorphic subtyping in O'Haskell (Q700972) (← links)
- Mathematics of program construction. 7th international conference, MPC 2004, Stirling, Scotland, UK, July 12--14, 2004. Proceedings. (Q704826) (← links)
- The world's shortest correct exact real arithmetic program? (Q714620) (← links)
- Refined typing to localize the impact of forced strictness on free theorems (Q766167) (← links)
- Leveraging compiler intermediate representation for multi- and cross-language verification (Q784116) (← links)
- A distributed functional framework for recursive finite element simulations (Q811732) (← links)
- Simplifying regular expressions further (Q820947) (← links)
