- Simulation and Performance Estimation for the Rewrite Rule Machine
- Algorithmic aspects of type inference with subtypes Patrick Lincoln
- Minimal Data Upgrading to Prevent Inference and Association Attacks Steven Dawson1 Sabrina De Capitani di Vimercati2y Patrick Lincoln1 Pierangela Samarati1z
- First Order Linear Logic Without Modalities is NEXPTIMEHard
- Algorithmic aspects of type inference with subtypes Patrick Lincoln \Lambda
- Decision Problems for Propositional Linear Logic Patrick Lincoln1;3 John Mitchell1 Andre Scedrov2
- A Formally Veri ed Algorithm for Interactive Consistency Under a Hybrid Fault Model
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Appeared in JSC 1989, vol 8 Adventures in Associative-Commutative Uni cation
- Appeared in CADE 9, 1988, LNCS 310 Adventures in AssociativeCommutative Unification
- Appeared in French Journal ``T.A.Informations'' 1991 A Natural Language for Natural Language
- A Formally Verified Algorithm for Interactive Consistency Under a Hybrid Fault Model \Lambda
- A Metanotation for Protocol Analysis \Lambda I. Cervesato N.A. Durgin P.D. Lincoln J.C. Mitchell A. Scedrov
- The Formal Verification of an Algorithm for Interactive Consistency under a Hybrid Fault
- The Formal Veri cation of an Algorithm for Interactive Consistency under a Hybrid Fault
- Linearizing Intuitionistic Implication (Appeared in ACM Symposium on Logic in Computer Science 1991)
- A probabilistic poly-time framework for protocol analysis P. Lincoln y
- Decision Problems For Second-Order Linear Logic Reprint from: Tenth Annual IEEE Symposium on Logic in Computer Science (LICS'95)
- Deciding Provability of Linear Logic To appear in Advances in Linear Logic
- First Order Linear Logic Without Modalities is NEXPTIME-Hard
- Compiling Rewriting onto SIMD and MIMD/SIMD Machines
- Appeared in SIGACT 1992 Linear Logic
- Appeared in ACM Symposium on Logic In Computer Science 1992 Operational aspects of linear lambda calculus
- Appeared in FOCS 1990 Decision Problems for Propositional Linear Logic
- in Computer Science, Amsterdam, pages 32--42. IEEE Computer Soci ety Press, Los Alamitos, California, July 1991. Full paper to appear in
- BIBLIOGRAPHY 233 90] N. Vorobjev. New derivability algorithm in the constructive propositional calcu-
- Appeared in CADE 9, 1988, LNCS 310 Adventures in Associative-Commutative Uni cation
- Deciding Provability of Linear Logic To appear in Advances in Linear Logic
- Appeared in TOPLAS 11-1-1989 E cient Implementation of Lattice Operationsy
- Appeared in ACM Symposium on Logic In Computer Science 1992 Operational aspects of linear lambda calculus
- Linearizing Intuitionistic Implication (Appeared in ACM Symposium on Logic in Computer Science 1991)
- Appeared in FOCS 1990 Decision Problems for Propositional Linear Logic
- Appeared in CADE 9, 1988, LNCS 310 Adventures in Associative-Commutative Unification
- Deciding Provability of Linear Logic Formulas
- Appeared in SIGACT 1992 Linear Logic
- Decision Problems for Propositional Linear Logic Patrick Lincoln 1;3 John Mitchell 1 Andre Scedrov 2
- Appeared in TOPLAS 1111989 Efficient Implementation of Lattice Operations y
- Appeared in FOCS 1990 Decision Problems for Propositional Linear Logic
- Appeared in French Journal \T.A.Informations" 1991 A Natural Language for Natural Language
- Simulation and Performance Estimation for the Rewrite Rule Machine \Lambda
- Probabilistic Polynomial-Time Equivalence and Security Analysis
- Appeared in JSC 1989, vol 8 Adventures in AssociativeCommutative Unification
- Compiling Rewriting onto SIMD and MIMD/SIMD Machines
- Minimal Data Upgrading to Prevent Inference and Association Attacks \Lambda Steven Dawson 1 Sabrina De Capitani di Vimercati 2y Patrick Lincoln 1 Pierangela Samarati 1z
- A Meta-notation for Protocol Analysis I. Cervesato N.A. Durgin P.D. Lincoln J.C. Mitchell A. Scedrov
- Linearizing Intuitionistic Implication (Appeared in ACM Symposium on Logic in Computer Science 1991)
- Compiling Rewriting onto SIMD and MIMD/SIMD Machines
- Algorithmic aspects of type inference with subtypes Patrick Lincoln * John C. Mitchell y
- Appeared in TOPLAS 11-1-1989 Efficient Implementation of Lattice Operationsy
- First Order Linear Logic Without Modalities is NEXPTIME-Hard
- A Formally Verified Algorithm for Interactive Consistency Under a Hybrid Fault Model*
- Decision Problems for Propositional Linear Logic Patrick Lincoln1,3 John Mitchell1 Andre Scedrov2
- Appeared in SIGACT 1992 Linear Logic
- Appeared in JSC 1989, vol 8 Adventures in Associative-Commutative Unification
- Simulation and Performance Estimation for the Rewrite Rule Machine*
- Pathway Logic Modeling of Protein Functional Domains in Signal Transduction
- in Computer Science, Amsterdam, pages 32{42. IEEE Computer Soci-ety Press, Los Alamitos, California, July 1991. Full paper to appear in
- Decision Problems For SecondOrder Linear Logic Reprint from: Tenth Annual IEEE Symposium on Logic in Computer Science (LICS'95)
- A probabilistic polytime framework for protocol analysis P. Lincoln \Lambday
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Probabilistic Polynomial-Time Equivalence and Security Analysis
- Appeared in ACM Symposium on Logic In Computer Science 1992 Operational aspects of linear lambda calculus
- Decision Problems For Second-Order Linear Logic Reprint from: Tenth Annual IEEE Symposium on Logic in Computer Scienc*
- Appeared in French Journal "T.A.Informations" 1991 LIFE
- DIMACS Series in Discrete Mathematics andVTheoreticaloComputerlScienceume 00, 0000
- The Formal Verification of an Algorithm for Interactive Consistency under a Hybrid Fault
