The following pages link to The Zipper (Q4376491):
Displaying 43 items.
- Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition (Q385017) (← links)
- On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation (Q428886) (← links)
- On graph rewriting, reduction, and evaluation in the presence of cycles (Q526460) (← links)
- Constructing language processors with algebra combinators (Q608238) (← links)
- A proof-centric approach to mathematical assistants (Q865648) (← links)
- Inter-deriving semantic artifacts for object-oriented programming (Q980939) (← links)
- Types as graphs: Continuations in type logical grammar (Q1006443) (← links)
- The locally nameless representation (Q1945914) (← links)
- Zipping strategies and attribute grammars (Q2163164) (← links)
- Backward type inference for XML queries (Q2182320) (← links)
- A survey of strategies in rule-based program transformation systems (Q2456575) (← links)
- A static simulation of dynamic delimited control (Q2464731) (← links)
- A formally verified compiler back-end (Q2655327) (← links)
- Incremental Computing with Abstract Data Structures (Q2798280) (← links)
- Comonadic Notions of Computation (Q2873672) (← links)
- Deletion: The curse of the red-black tree (Q2933113) (← links)
- Proofs, Upside Down (Q2937799) (← links)
- Polynomial Functors Constrained by Regular Expressions (Q2941172) (← links)
- Efficiently Deciding μ-Calculus with Converse over Finite Trees (Q2957698) (← links)
- Verification of the Schorr-Waite Algorithm – From Trees to Graphs (Q3003486) (← links)
- Minimalist Grammars and Minimalist Categorial Grammars: Toward Inclusion of Generated Languages (Q3013023) (← links)
- Lazy tree splitting (Q3165522) (← links)
- A unified treatment of syntax with binders (Q3165528) (← links)
- From Reduction-Based to Reduction-Free Normalization (Q3649133) (← links)
- A Generic Functional Representation of Sorted Trees Supporting Attribution (Q4916074) (← links)
- Lambda calculus with algebraic simplification for reduction parallelisation: Extended study (Q5016210) (← links)
- A type- and scope-safe universe of syntaxes with binding: their semantics and proofs (Q5019018) (← links)
- Bottom-Up derivatives of tree expressions (Q5021108) (← links)
- An optimal, purely functional implementation of the Garsia–Wachs algorithm (Q5110926) (← links)
- Effect handlers via generalised continuations (Q5110928) (← links)
- Doo bee doo bee doo (Q5110934) (← links)
- Continuation passing style for effect handlers (Q5111314) (← links)
- Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers (Q5166620) (← links)
- Recognizing Strategies (Q5170163) (← links)
- Understanding and maintaining tactics graphically OR how we are learning that a diagram can be worth more than 10K LoC (Q5195279) (← links)
- Interleaving Strategies (Q5200118) (← links)
- Indexed containers (Q5371943) (← links)
- The essence of ornaments (Q5372005) (← links)
- Finiteness and rational sequences, constructively (Q5372009) (← links)
- Idris, a general-purpose dependently typed programming language: Design and implementation (Q5398331) (← links)
- A monadic framework for delimited continuations (Q5428371) (← links)
- Programming language semantics: It’s easy as 1,2,3 (Q6065508) (← links)
- Partial bounding for recursive function synthesis (Q6632203) (← links)
