 | 2010 |
| 24 |  | Douglas J. Howe:
Higher-Order Abstract Syntax in Isabelle/HOL.
ITP 2010: 481-484 |
| 2009 |
| 23 |  | Douglas J. Howe:
Higher-order abstract syntax in classical higher-order logic.
LFMTP 2009: 1-11 |
| 2001 |
| 22 |  | Douglas J. Howe,
James E. Cuccaro:
Electricity Deregulation: It's New Bonanza.
IS Management 18(3): 83-91 (2001) |
| 1999 |
| 21 |  | Amy P. Felty,
Douglas J. Howe,
Abhik Roychoudhury:
Formal Metatheory using Implicit Syntax, and an Application to Data Abstraction for Asynchronous Systems.
CADE 1999: 237-251 |
| 20 |  | Douglas J. Howe:
Interactive Theorem Proving Using Type Theory.
CSL 1999: 578 |
| 1998 |
| 19 |  | Amy P. Felty,
Douglas J. Howe,
Frank A. Stomp:
Protocol Verification in Nuprl.
CAV 1998: 428-439 |
| 18 |  | Douglas J. Howe:
A Type Annotation Scheme for Nuprl.
TPHOLs 1998: 207-224 |
| 1997 |
| 17 |  | Amy P. Felty,
Douglas J. Howe:
Hybrid Interactive Theorem Proving Using Nuprl and HOL.
CADE 1997: 351-365 |
| 1996 |
| 16 |  | Douglas J. Howe:
Semantic Foundations for Embedding HOL in Nuprl.
AMAST 1996: 85-101 |
| 15 |  | Douglas J. Howe:
Importing Mathematics from HOL into Nuprl.
TPHOLs 1996: 267-281 |
| 14 |  | Douglas J. Howe:
Proving Congruence of Bisimulation in Functional Programming Languages.
Inf. Comput. 124(2): 103-112 (1996) |
| 1994 |
| 13 |  | Amy P. Felty,
Douglas J. Howe:
Tactic Theorem Proving with Refinement-Tree Proofs and Metavariables.
CADE 1994: 605-619 |
| 12 |  | Amy P. Felty,
Douglas J. Howe:
Generalization and Reuse of Tactic Proofs.
LPAR 1994: 1-15 |
| 11 |  | Douglas J. Howe,
Scott D. Stoller:
An Operational Approach to Combining Classical Set Theory and Functional Programming Languages.
TACS 1994: 36-55 |
| 1993 |
| 10 |  | Douglas J. Howe:
Reasoning About Functional Programs in Nuprl.
Functional Programming, Concurrency, Simulation and Automated Reasoning 1993: 145-164 |
| 1991 |
| 9 |  | Jawahar Chirimar,
Douglas J. Howe:
Implementing Constructive Real Analysis: Preliminary Report.
Constructivity in Computer Science 1991: 165-178 |
| 8 |  | Douglas J. Howe:
On Computational Open-Endedness in Martin-Löf's Type Theory
LICS 1991: 162-172 |
| 7 |  | David A. Basin,
Douglas J. Howe:
Some Normalization Properties of Martin-Löf's Type Theory, and Applications.
TACS 1991: 475-494 |
| 1990 |
| 6 |  | Stuart F. Allen,
Robert L. Constable,
Douglas J. Howe,
William E. Aitken:
The Semantics of Reflected Proof
LICS 1990: 95-105 |
| 1989 |
| 5 |  | Douglas J. Howe:
Equality In Lazy Computation Systems
LICS 1989: 198-203 |
| 1988 |
| 4 |  | Douglas J. Howe:
Computational Metatheory in Nuprl.
CADE 1988: 238-257 |
| 1987 |
| 3 |  | Douglas J. Howe:
The Computational Behaviour of Girard's Paradox
LICS 1987: 205-214 |
| 1986 |
| 2 |  | Robert L. Constable,
Stuart F. Allen,
Mark Bromley,
Rance Cleaveland,
J. F. Cremer,
R. W. Harper,
Douglas J. Howe,
Todd B. Knoblock,
N. P. Mendler,
Prakash Panangaden,
James T. Sasaki,
Scott F. Smith:
Implementing mathematics with the Nuprl proof development system.
Prentice Hall 1986: I-X, 1-299 |
| 1 |  | Douglas J. Howe:
Implementing Number Theory: An Experiment with Nuprl.
CADE 1986: 404-415 |