Pages that link to "Item:Q5437031"

The following pages link to Applicative programming with effects (Q5437031):

Displaying 50 items.

• Constructing language processors with algebra combinators (Q608238) (← links)
• Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation (Q831147) (← links)
• A computer-verified monadic functional implementation of the integral (Q987984) (← links)
• Generalising monads to arrows (Q1566910) (← links)
• Lewis meets Brouwer: constructive strict implication (Q1688950) (← links)
• A model of guarded recursion via generalised equilogical spaces (Q1704599) (← links)
• The Cooper storage idiom (Q1711505) (← links)
• A denotational semantics of textually aligned SPMD programs (Q2011201) (← links)
• Implementing, and keeping in check, a DSL used in E-learning (Q2039947) (← links)
• Temporal refinements for guarded recursive types (Q2233479) (← links)
• Guarded cubical type theory (Q2319985) (← links)
• Guarded Dependent Type Theory with Coinductive Types (Q2811330) (← links)
• Equational Reasoning with Applicative Functors (Q2829262) (← links)
• Polynomial Functors Constrained by Regular Expressions (Q2941172) (← links)
• The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types (Q2974778) (← links)
• APLicative Programming with Naperian Functors (Q2988659) (← links)
• Concrete stream calculus: An extended study (Q3021409) (← links)
• Scala for generic programmers (Q3070770) (← links)
• Composable Discovery Engines for Interactive Theorem Proving (Q3088022) (← links)
• A unified treatment of syntax with binders (Q3165528) (← links)
• Probabilistic Programming Language and its Incremental Evaluation (Q3179303) (← links)
• (Q3384908) (← links)
• A pattern for almost compositional functions (Q3546044) (← links)
• The worker/wrapper transformation (Q3616448) (← links)
• The Arrow Calculus as a Quantum Programming Language (Q3638297) (← links)
• The essence of the <scp>Iterator</scp> pattern (Q3638921) (← links)
• The Bird Tree (Q3644933) (← links)
• Denotational semantics of recursive types in synthetic guarded domain theory (Q4623133) (← links)
• Notions of computation as monoids (Q4625158) (← links)
• 1ML – Core and modules united (Q4625163) (← links)
• Causal commutative arrows (Q4918242) (← links)
• (Q4993353) (← links)
• A type- and scope-safe universe of syntaxes with binding: their semantics and proofs (Q5019018) (← links)
• Extensional equality preservation and verified generic programming (Q5019020) (← links)
• Doo bee doo bee doo (Q5110934) (← links)
• Build systems à la carte: Theory and practice (Q5110937) (← links)
• Negative translations and normal modality (Q5111325) (← links)
• Denotational semantics for guarded dependent type theory (Q5139284) (← links)
• (Q5141620) (← links)
• (Q5155672) (← links)
• What is a Categorical Model of Arrows? (Q5166619) (← links)
• Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous (Q5166623) (← links)
• The arrow calculus (Q5189645) (← links)
• Combinator Parsing: A Short Tutorial (Q5191092) (← links)
• Constructive Modalities with Provability Smack (Q5255796) (← links)
• A representation theorem for second-order functionals (Q5371942) (← links)
• Understanding beginners' mistakes with Haskell (Q5371952) (← links)
• A model of guarded recursion with clock synchronisation (Q5971393) (← links)
• A model of PCF in guarded type theory (Q5971407) (← links)
• A correct-by-construction conversion from lambda calculus to combinatory logic (Q6065511) (← links)