The following pages link to Haskell (Q16052):
Displaying 50 items.
- Head boundedness of nonterminating rewritings (Q1894332) (← links)
- A logic for Miranda, revisited (Q1903076) (← links)
- Kinded type inference for parametric overloading (Q1911131) (← links)
- Relating graph and term rewriting via Böhm models (Q1924551) (← links)
- Trends in trends in functional programming 1999/2000 versus 2007/2008 (Q1929344) (← links)
- More dependent types for distributed arrays (Q1929345) (← links)
- A functional approach to generic programming using adaptive traversals (Q1929347) (← links)
- Pruning with improving sequences in lazy functional programs (Q1929352) (← links)
- Towards a linear algebra of programming (Q1941862) (← links)
- On building cyclic and shared structures in Haskell (Q1941875) (← links)
- Filter-embedding semiring fusion for programming with MapReduce (Q1941877) (← links)
- 2000 ACM SIGPLAN Haskell workshop (satellite event of PLI 2000), Montreal, Canada, September 17, 2000. Proceedings (Q1948368) (← links)
- Modular verification of programs with effects and effects handlers (Q1996433) (← links)
- A survey of challenges for runtime verification from advanced application domains (beyond software) (Q2008293) (← links)
- Monads for the formalization of a pattern matching procedure (Q2017780) (← links)
- Implementing hybrid semantics: from functional to imperative (Q2037951) (← links)
- Declarative stream runtime verification (hLola) (Q2038065) (← links)
- Implementing, and keeping in check, a DSL used in E-learning (Q2039947) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
- Synthetic tableaux: Minimal tableau search heuristics (Q2104533) (← links)
- Nominal unification with letrec and environment-variables (Q2119105) (← links)
- Testing your (static analysis) truths (Q2119122) (← links)
- Chromar, a rule-based language of parameterised objects (Q2130570) (← links)
- Iterated covariant powerset is not a monad (Q2134821) (← links)
- A formally verified cut-elimination procedure for linear nested sequents for tense logic (Q2142082) (← links)
- Nonlinear pattern matching in rule-based modeling languages (Q2142118) (← links)
- Axiomatic reals and certified efficient exact real computation (Q2148797) (← links)
- Translation certification for smart contracts (Q2163161) (← links)
- Zipping strategies and attribute grammars (Q2163164) (← links)
- A functional account of probabilistic programming with possible worlds. Declarative pearl (Q2163171) (← links)
- Computable model discovery and high-level-programming approximations to algorithmic complexity (Q2163372) (← links)
- On a machine-checked proof for fraction arithmetic over a GCD domain (Q2217198) (← links)
- Leveraging the information contained in theory presentations (Q2219380) (← links)
- Safe functional systems through integrity types and verified assembly (Q2220814) (← links)
- Agda formalization of a security-preserving translation from flow-sensitive to flow-insensitive security types (Q2229149) (← links)
- Is genome written in Haskell? (Q2242585) (← links)
- Models of quantum computation and quantum programming languages (Q2250909) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- A programmable editor for developing structured documents based on bidirectional transformations (Q2271900) (← links)
- Dynamic slicing of lazy functional programs based on redex trails (Q2271904) (← links)
- From LCF to Isabelle/HOL (Q2280211) (← links)
- Limited second-order functionality in a first-order setting (Q2303245) (← links)
- Practical synthesis of reactive systems from LTL specifications via parity games (Q2303871) (← links)
- Statistical properties of lambda terms (Q2327214) (← links)
- A semantic investigation of spiking neural P systems (Q2328323) (← links)
- Observational program calculi and the correctness of translations (Q2339472) (← links)
- View-based propagator derivation (Q2342586) (← links)
- Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures (Q2347907) (← links)
- Implementing and reasoning about hash-consed data structures in Coq (Q2351422) (← links)
