The Zipper
From MaRDI portal
Publication:4376491
DOI10.1017/S0956796897002864zbMath0893.68014OpenAlexW2912949875WikidataQ29036237 ScholiaQ29036237MaRDI QIDQ4376491
Publication date: 11 February 1998
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796897002864
Related Items
Lazy tree splitting, A unified treatment of syntax with binders, Zipping strategies and attribute grammars, A proof-centric approach to mathematical assistants, A formally verified compiler back-end, Deletion: The curse of the red-black tree, Proofs, Upside Down, Polynomial Functors Constrained by Regular Expressions, Constructing language processors with algebra combinators, Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition, Backward type inference for XML queries, Programming language semantics: It’s easy as 1,2,3, The next 700 program transformers, Efficiently Deciding μ-Calculus with Converse over Finite Trees, An optimal, purely functional implementation of the Garsia–Wachs algorithm, Effect handlers via generalised continuations, Doo bee doo bee doo, The locally nameless representation, On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation, Indexed containers, The essence of ornaments, Finiteness and rational sequences, constructively, A survey of strategies in rule-based program transformation systems, Verification of the Schorr-Waite Algorithm – From Trees to Graphs, Idris, a general-purpose dependently typed programming language: Design and implementation, A static simulation of dynamic delimited control, Minimalist Grammars and Minimalist Categorial Grammars: Toward Inclusion of Generated Languages, A Generic Functional Representation of Sorted Trees Supporting Attribution, On graph rewriting, reduction, and evaluation in the presence of cycles, Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers, Recognizing Strategies, A monadic framework for delimited continuations, Inter-deriving semantic artifacts for object-oriented programming, Interleaving Strategies, Incremental Computing with Abstract Data Structures, Types as graphs: Continuations in type logical grammar, From Reduction-Based to Reduction-Free Normalization, Continuation passing style for effect handlers, Lambda calculus with algebraic simplification for reduction parallelisation: Extended study, Understanding and maintaining tactics graphically OR how we are learning that a diagram can be worth more than 10K LoC, A type- and scope-safe universe of syntaxes with binding: their semantics and proofs, Bottom-Up derivatives of tree expressions, Comonadic Notions of Computation
