The following pages link to Patricia Johann (Q673970):
Displayed 41 items.
- A combinatory logic approach to higher-order E-unification (Q673971) (← links)
- A principled approach to programming with nested types in Haskell (Q848745) (← links)
- A family of syntactic logical relations for the semantics of Haskell-like languages (Q1012131) (← links)
- An improved general \(E\)-unification method (Q1201347) (← links)
- Warm fusion in Stratego: A case study in generation of program transformation systems (Q1601856) (← links)
- A generalization of short-cut fusion and its correctness proof (Q1870296) (← links)
- Normal forms in combinatory logic (Q1903133) (← links)
- Deep induction: induction rules for (truly) nested types (Q2200833) (← links)
- Parametricity for primitive nested types (Q2233419) (← links)
- Local presentability of certain comma categories (Q2303778) (← links)
- A productivity checker for logic programming (Q2409734) (← links)
- Selective strictness and parametricity in structural operational semantics, inequationally (Q2464947) (← links)
- Fusing Logic and Control with Local Transformations (Q2841226) (← links)
- Refining Inductive Types (Q2890506) (← links)
- Fibrational Induction Meets Effects (Q2892757) (← links)
- Generic Fibrational Induction (Q2895473) (← links)
- Abstraction and invariance for algebraically indexed types (Q2931786) (← links)
- Monadic augment and generalised short cut fusion (Q2936792) (← links)
- When Is a Type Refinement an Inductive Type? (Q3000600) (← links)
- Foundations for structured programming with GADTs (Q3189848) (← links)
- Free theorems in the presence of <i>seq</i> (Q3452253) (← links)
- Fibrational Induction Rules for Initial Algebras (Q3586050) (← links)
- Initial Algebra Semantics Is Enough! (Q3612632) (← links)
- (Q4331757) (← links)
- (Q4445767) (← links)
- Short cut fusion is correct (Q4461770) (← links)
- (Q4631184) (← links)
- On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi (Q4675766) (← links)
- (Q5028445) (← links)
- Solving simplification ordering constraints (Q5096318) (← links)
- A General Framework for Relational Parametricity (Q5145366) (← links)
- Unification in an extensional lambda calculus with ordered function sorts and constant overloading (Q5210801) (← links)
- Interleaving data and effects (Q5371955) (← links)
- A relationally parametric model of dependent type theory (Q5408445) (← links)
- Monadic augment and generalised short cut fusion (Q5428372) (← links)
- (Q5472909) (← links)
- Indexed Induction and Coinduction, Fibrationally (Q5891134) (← links)
- Indexed Induction and Coinduction, Fibrationally (Q5894256) (← links)
- Bifibrational functorial semantics of parametric polymorphism (Q5971398) (← links)
- Characterizing functions mappable over GADTs (Q6176570) (← links)
- On local presentability of T/A (Q6304192) (← links)