The following pages link to Haskell (Q16052):
Displaying 50 items.
- Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation (Q831147) (← links)
- High-level modelling for typed functional programming (Q832100) (← links)
- Probabilistic modelling, inference and learning using logical theories (Q841641) (← links)
- Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers (Q848679) (← links)
- Compilation of extended recursion in call-by-value functional languages (Q848739) (← links)
- Expressible sharing for functional circuit description (Q848741) (← links)
- A principled approach to programming with nested types in Haskell (Q848745) (← links)
- Dynamic state restoration using versioning exceptions (Q853735) (← links)
- Polymorphic typed defunctionalization and concretization (Q853737) (← links)
- Explicit substitutions and higher-order syntax (Q853744) (← links)
- Transposing partial components--an exercise on coalgebraic refinement (Q854163) (← links)
- 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. (Q855057) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Type checking a multithreaded functional language with session types (Q859841) (← links)
- SAD as a mathematical assistant -- how should we go from here to there? (Q865654) (← links)
- Generalising the array split obfuscation (Q867610) (← links)
- Customizing an XML-Haskell data binding with type isomorphism inference in generic Haskell (Q870274) (← links)
- Costing stepwise refinements of parallel programs (Q875957) (← links)
- Verification of FPGA layout generators in higher-order logic (Q877830) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Flow analysis of lazy higher-order functional programs (Q879358) (← links)
- Infinitary rewriting: meta-theory and convergence (Q884993) (← links)
- A logic for Miranda (Q909443) (← links)
- Generic programming in 3D (Q923888) (← links)
- A formal model of a system for automated program parallelization (Q927439) (← links)
- Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types (Q929967) (← links)
- Arrows for secure information flow (Q964489) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- A generic complete dynamic logic for reasoning about purity and effects (Q973056) (← links)
- A compact fixpoint semantics for term rewriting systems (Q987981) (← links)
- Type-directed weaving of aspects for polymorphically typed functional languages (Q988192) (← links)
- Type inference and strong static type checking for Promela (Q988201) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Implementing a computer algebra system in Haskell (Q990498) (← links)
- An update calculus for expressing type-safe program updates (Q997231) (← links)
- HasCasl: integrated higher-order specification and program development (Q1006648) (← links)
- A family of syntactic logical relations for the semantics of Haskell-like languages (Q1012131) (← links)
- Recasting ML\(^{\text F}\) (Q1023287) (← links)
- Deterministic second-order patterns (Q1029104) (← links)
- Nesting forward-mode AD in a functional framework (Q1029813) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
- On the algebraic structure of declarative programming languages (Q1035699) (← links)
- Operating system verification---an overview (Q1040002) (← links)
- Operational termination of conditional term rewriting systems (Q1041807) (← links)
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations (Q1196302) (← links)
- Winskel is (almost) right: Towards a mechanized semantics textbook (Q1272764) (← links)
- Functional-logic integration via minimal reciprocal extensions (Q1275622) (← links)
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- A co-induction principle for recursively defined domains (Q1318702) (← links)
- Bounded quantifications for iteration and concurrency in logic programming (Q1326573) (← links)
