Search the dblp DataBase

Publications of Author

1. Daniel J. Dougherty, Patricia Johann
   An Improved General E-Unification Method. [Citation Graph (0, 0)][DBLP]
   CADE, 1990, pp:261-275 [Conf]
   
2. Daniel J. Dougherty, Patricia Johann
   A Combinatory Logic Approach to Higher-order E-unification (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   CADE, 1992, pp:79-93 [Conf]
   
3. Patricia Johann, Michael Kohlhase
   Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading. [Citation Graph (0, 0)][DBLP]
   CADE, 1994, pp:620-634 [Conf]
   
4. Patricia Johann, Rolf Socher-Ambrosius
   Solving Simplification Ordering Constraints. [Citation Graph (0, 0)][DBLP]
   CCL, 1994, pp:352-367 [Conf]
   
5. Walid Taha, Patricia Johann
   Staged Notational Definitions. [Citation Graph (0, 0)][DBLP]
   GPCE, 2003, pp:97-116 [Conf]
   
6. Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo Vene
   Monadic augment and generalised short cut fusion. [Citation Graph (0, 0)][DBLP]
   ICFP, 2005, pp:294-305 [Conf]
   
7. Patricia Johann, Janis Voigtländer
   Free theorems in the presence of seq. [Citation Graph (0, 0)][DBLP]
   POPL, 2004, pp:99-110 [Conf]
   
8. Patricia Johann
   Short Cut Fusion: Proved and Improved. [Citation Graph (0, 0)][DBLP]
   SAIG, 2001, pp:47-71 [Conf]
   
9. Patricia Johann, Eelco Visser
   Warm fusion in Stratego: A case study in generation of program transformation systems. [Citation Graph (0, 0)][DBLP]
   Ann. Math. Artif. Intell., 2000, v:29, n:1-4, pp:1-34 [Journal]
   
10. Patricia Johann, Janis Voigtländer
    The Impact of seq on Free Theorems-Based Program Transformations. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:69, n:1-2, pp:63-102 [Journal]
    
11. Patricia Johann
    Short cut fusion is correct. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:4, pp:797-814 [Journal]
    
12. Daniel J. Dougherty, Patricia Johann
    An Improved General E-Unification Method. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1992, v:14, n:4, pp:303-320 [Journal]
    
13. Patricia Johann
    A Generalization of Short-Cut Fusion and its Correctness Proof. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2002, v:15, n:4, pp:273-300 [Journal]
    
14. Patricia Johann
    On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2005, v:15, n:2, pp:201-229 [Journal]
    
15. Patricia Johann
    Normal Forms in Combinatory Logic. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1994, v:35, n:4, pp:573-594 [Journal]
    
16. Daniel J. Dougherty, Patricia Johann
    A Combinatory Logic Approach to Higher-Order E-Unification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:207-242 [Journal]
    
17. Patricia Johann, Eelco Visser
    Fusing Logic and Control with Local Transformations: An Example Optimization. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:57, n:, pp:- [Journal]
    
18. Patricia Johann, Neil Ghani
    Initial Algebra Semantics Is Enough! [Citation Graph (0, 0)][DBLP]
    TLCA, 2007, pp:207-222 [Conf]
    
19. 
    Fibrational Induction Rules for Initial Algebras. [Citation Graph (, )][DBLP]
    
    
20. 
    A Generic Operational Metatheory for Algebraic Effects. [Citation Graph (, )][DBLP]
    
    
21. 
    Foundations for structured programming with GADTs. [Citation Graph (, )][DBLP]