|
Search the dblp DataBase
Daniel J. Dougherty:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Daniel J. Dougherty, Kathi Fisler, Shriram Krishnamurthi
Specifying and Reasoning About Dynamic Access-Control Policies. [Citation Graph (0, 0)][DBLP] IJCAR, 2006, pp:632-646 [Conf]
- Daniel J. Dougherty, Patricia Johann
An Improved General E-Unification Method. [Citation Graph (0, 0)][DBLP] CADE, 1990, pp:261-275 [Conf]
- 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]
- Daniel J. Dougherty, Stephane Lengrand, Pierre Lescanne
An Improved System of Intersection Types for Explicit Substitutions. [Citation Graph (0, 0)][DBLP] IFIP TCS, 2002, pp:511-523 [Conf]
- Daniel J. Dougherty, Ramesh Subrahmanyam
Equality between Functionals in the Presence of Coproducts [Citation Graph (0, 0)][DBLP] LICS, 1995, pp:282-291 [Conf]
- Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne, Silvia Likavec
Strong Normalization of the Dual Classical Sequent Calculus. [Citation Graph (0, 0)][DBLP] LPAR, 2005, pp:169-183 [Conf]
- Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne
Characterizing strong normalization in a language with control operators. [Citation Graph (0, 0)][DBLP] PPDP, 2004, pp:155-166 [Conf]
- Daniel J. Dougherty
Adding Algebraic Rewriting to the Untyped Lambda Calculus (Extended Abstract). [Citation Graph (0, 0)][DBLP] RTA, 1991, pp:37-48 [Conf]
- Daniel J. Dougherty
Some Lambda Calculi with Categorial Sums and Products. [Citation Graph (0, 0)][DBLP] RTA, 1993, pp:137-151 [Conf]
- Daniel J. Dougherty, Claudio Gutiérrez
Normal Forms and Reduction for Theories of Binary Relations. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:95-109 [Conf]
- Daniel J. Dougherty, Tomasz Wierzbicki
A Decidable Variant of Higher Order Matching. [Citation Graph (0, 0)][DBLP] RTA, 2002, pp:340-351 [Conf]
- Friedrich Otto, Paliath Narendran, Daniel J. Dougherty
Some Independent Results for Equational Unification. [Citation Graph (0, 0)][DBLP] RTA, 1995, pp:367-381 [Conf]
- Daniel J. Dougherty, Pierre Lescanne
Reductions, Intersection Types, and Explicit Substitutions. [Citation Graph (0, 0)][DBLP] TLCA, 2001, pp:121-135 [Conf]
- Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne
Intersection and Union Types in the lambda-my-my/tilde-calculus. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2005, v:136, n:, pp:153-172 [Journal]
- Daniel J. Dougherty, Pierre Lescanne, Luigi Liquori, Frédéric Lang
Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2005, v:127, n:5, pp:57-82 [Journal]
- Daniel J. Dougherty
Adding Algebraic Rewriting to the Untyped Lambda Calculus [Citation Graph (0, 0)][DBLP] Inf. Comput., 1992, v:101, n:2, pp:251-267 [Journal]
- Daniel J. Dougherty, Ramesh Subrahmanyam
Equality between Functionals in the Presence of Coproducts. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2000, v:157, n:1-2, pp:52-83 [Journal]
- Stephane Lengrand, Pierre Lescanne, Daniel J. Dougherty, Mariangiola Dezani-Ciancaglini, Steffen van Bakel
Intersection types for explicit substitutions. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2004, v:189, n:1, pp:17-42 [Journal]
- Daniel J. Dougherty, Stanley M. Selkow
The complexity of the certification of properties of Stable Marriage. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:92, n:6, pp:275-277 [Journal]
- Daniel J. Dougherty
Decomposition of infinite matrices. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1987, v:45, n:2, pp:277-289 [Journal]
- 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]
- Daniel J. Dougherty, Pierre Lescanne
Reductions, Intersection Types, and Explicit Substitutions. [Citation Graph (0, 0)][DBLP] Mathematical Structures in Computer Science, 2003, v:13, n:1, pp:55-85 [Journal]
- Daniel J. Dougherty
Closed Categories and Categorial Grammar. [Citation Graph (0, 0)][DBLP] Notre Dame Journal of Formal Logic, 1993, v:34, n:1, pp:36-49 [Journal]
- Murali Mani, Song Wang, Daniel J. Dougherty, Elke A. Rundensteiner
Join minimization in XML-to-SQL translation: an algebraic approach. [Citation Graph (0, 0)][DBLP] SIGMOD Record, 2006, v:35, n:1, pp:20-25 [Journal]
- Daniel J. Dougherty
Higher-Order Unification via Combinators. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1993, v:114, n:2, pp:273-298 [Journal]
- Daniel J. Dougherty, Claudio Gutiérrez
Normal forms for binary relations. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:360, n:1-3, pp:228-246 [Journal]
- 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]
- Friedrich Otto, Paliath Narendran, Daniel J. Dougherty
Equational Unification, Word Unification, and 2nd-Order Equational Unification. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:198, n:1-2, pp:1-47 [Journal]
- Daniel J. Dougherty, Kathi Fisler, Shriram Krishnamurthi
Obligations and Their Interaction with Programs. [Citation Graph (0, 0)][DBLP] ESORICS, 2007, pp:375-389 [Conf]
- Daniel J. Dougherty, Claude Kirchner, Hélène Kirchner, Anderson Santana de Oliveira
Modular Access Control Via Strategic Rewriting. [Citation Graph (0, 0)][DBLP] ESORICS, 2007, pp:578-593 [Conf]
Multi-Join Continuous Query Optimization: Covering the Spectrum of Linear, Acyclic, and Cyclic Queries. [Citation Graph (, )][DBLP]
Towards an Operational Semantics for Alloy. [Citation Graph (, )][DBLP]
Alchemy: transmuting base alloy specifications into implementations. [Citation Graph (, )][DBLP]
Extensional and Intensional Strategies [Citation Graph (, )][DBLP]
An Improved Algorithm for Generating Database Transactions from Relational Algebra Specifications [Citation Graph (, )][DBLP]
Preface. [Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.008secs
|