Pages that link to "Item:Q749197"

The following pages link to Data structures and program transformation (Q749197):

Displaying 26 items.

• Constructing language processors with algebra combinators (Q608238) (← links)
• Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper) (Q832157) (← links)
• Datatype-generic termination proofs (Q1015386) (← links)
• Inductive data types for predicate transformers (Q1199549) (← links)
• Paramorphisms (Q1201295) (← links)
• Calculate categorically! (Q1203123) (← links)
• The derivation of on-line algorithms, with an application to finding palindromes (Q1314430) (← links)
• A hidden agenda (Q1575735) (← links)
• Generic recursive lens combinators and their calculation laws (Q2123055) (← links)
• Recursive coalgebras from comonads (Q2495640) (← links)
• Factorising folds for faster functions (Q3070772) (← links)
• From Coinductive Proofs to Exact Real Arithmetic (Q3644745) (← links)
• Libraries for Generic Programming in Haskell (Q3649135) (← links)
• Categories, relations and dynamic programming (Q4286530) (← links)
• Generic functional programming with types and relations (Q4880524) (← links)
• Datatype laws without signatures (Q4882491) (← links)
• Process Calculi à la Bird-Meertens (Q4917032) (← links)
• When is a function a fold or an unfold? (Q4917036) (← links)
• A type- and scope-safe universe of syntaxes with binding: their semantics and proofs (Q5019018) (← links)
• Categorical fixed point calculus (Q5057473) (← links)
• POPLMark reloaded: Mechanizing proofs by logical relations (Q5110924) (← links)
• Unifying structured recursion schemes (Q5371980) (← links)
• Fusion of recursive programs with computational effects (Q5941164) (← links)
• Least and greatest fixed points in intuitionistic natural deduction (Q5958300) (← links)
• Classical (co)recursion: Mechanics (Q6132720) (← links)
• Algebraic dynamical systems in machine learning (Q6181739) (← links)