The Zipper
From MaRDI portal
Recommendations
Cited in
(51)- Types as graphs: Continuations in type logical grammar
- The locally nameless representation
- Zipping strategies and attribute grammars
- Backward type inference for XML queries
- The zipper foldings of the diamond
- A survey of strategies in rule-based program transformation systems
- A static simulation of dynamic delimited control
- A formally verified compiler back-end
- Incremental computing with abstract data structures
- Comonadic notions of computation
- Deletion: The curse of the red-black tree
- Proofs, upside down. A functional correspondence between natural deduction and the sequent calculus
- Polynomial functors constrained by regular expressions
- Efficiently deciding -calculus with converse over finite trees
- Verification of the Schorr-Waite algorithm -- from trees to graphs
- Minimalist Grammars and Minimalist Categorial Grammars: Toward Inclusion of Generated Languages
- Lazy tree splitting
- A unified treatment of syntax with binders
- From reduction-based to reduction-free normalization
- Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition
- On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation
- A generic functional representation of sorted trees supporting attribution (Haskell can do it)
- Lambda calculus with algebraic simplification for reduction parallelisation: extended study
- A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
- Bottom-Up derivatives of tree expressions
- An optimal, purely functional implementation of the Garsia-Wachs algorithm
- Effect handlers via generalised continuations
- Doo bee doo bee doo
- Continuation passing style for effect handlers
- Attribute grammars as recursion schemes over cyclic representations of zippers
- Recognizing Strategies
- Understanding and maintaining tactics graphically OR how we are learning that a diagram can be worth more than 10K LoC
- Interleaving strategies
- On graph rewriting, reduction, and evaluation in the presence of cycles
- Indexed containers
- The essence of ornaments
- Finiteness and rational sequences, constructively
- Idris, a general-purpose dependently typed programming language: Design and implementation
- A monadic framework for delimited continuations
- Programming language semantics: It’s easy as 1,2,3
- Constructing language processors with algebra combinators
- The next 700 program transformers
- Partial bounding for recursive function synthesis
- Modular verification of intrusive list and tree data structures in separation logic
- Verifying peephole rewriting in SSA compiler IRs
- Tail recursion modulo context: an equational approach (extended version)
- Modules and PQ-trees in Robinson spaces
- A matching logic theory of multi-hole contexts
- Finiteness of symbolic derivatives in Lean
- A proof-centric approach to mathematical assistants
- Inter-deriving semantic artifacts for object-oriented programming
This page was built for publication: The Zipper
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376491)
