| 2008 |
| 57 | EE | Nathan Mishra-Linger,
Tim Sheard:
Erasure and Polymorphism in Pure Type Systems.
FoSSaCS 2008: 350-364 |
| 56 | EE | Tim Sheard,
Emir Pasalic:
Meta-programming With Built-in Type Equality.
Electr. Notes Theor. Comput. Sci. 199: 49-65 (2008) |
| 2007 |
| 55 | EE | Tim Sheard,
Nathan Linger:
Programming in Omega.
CEFP 2007: 158-227 |
| 54 | EE | Tim Sheard:
Type-level Computation Using Narrowing in Omegamega.
Electr. Notes Theor. Comput. Sci. 174(7): 105-128 (2007) |
| 53 | EE | Peter A. Tucker,
David Maier,
Tim Sheard,
Paul Stephens:
Using Punctuation Schemes to Characterize Strategies for Querying over Data Streams.
IEEE Trans. Knowl. Data Eng. 19(9): 1227-1240 (2007) |
| 2005 |
| 52 | EE | Tim Sheard:
Putting curry-howard to work.
Haskell 2005: 74-85 |
| 2004 |
| 51 | EE | Tim Sheard:
Languages of the future.
OOPSLA Companion 2004: 116-119 |
| 50 | EE | Nathan Linger,
Tim Sheard:
Binding-Time Analysis for MetaML via Type Inference and Constraint Solving.
TACAS 2004: 266-279 |
| 49 | EE | Tim Sheard,
Emir Pasalic:
Two-level types and parameterized modules.
J. Funct. Program. 14(5): 547-587 (2004) |
| 48 | EE | Tim Sheard:
Languages of the future.
SIGPLAN Notices 39(12): 119-132 (2004) |
| 2003 |
| 47 | EE | Peter A. Tucker,
David Maier,
Tim Sheard:
Applying Punctuation Schemes to Queries Over Continuous Data Streams.
IEEE Data Eng. Bull. 26(1): 33-40 (2003) |
| 46 | EE | Peter A. Tucker,
David Maier,
Tim Sheard,
Leonidas Fegaras:
Exploiting Punctuation Semantics in Continuous Data Streams.
IEEE Trans. Knowl. Data Eng. 15(3): 555-568 (2003) |
| 45 | EE | Cristiano Calcagno,
Eugenio Moggi,
Tim Sheard:
Closed types for a safe imperative MetaML.
J. Funct. Program. 13(3): 545-571 (2003) |
| 2002 |
| 44 | EE | Tim Sheard,
Nathan Linger:
Search-based binding time analysis using type-directed pruning.
ASIA-PEPM 2002: 20-31 |
| 43 | EE | Emir Pasalic,
Walid Taha,
Tim Sheard:
Tagless staged interpreters for typed languages.
ICFP 2002: 218-229 |
| 42 | EE | William L. Harrison,
Tim Sheard,
James Hook:
Fine Control of Demand in Haskell.
MPC 2002: 68-93 |
| 41 | EE | Tim Sheard,
Simon L. Peyton Jones:
Template meta-programming for Haskell.
SIGPLAN Notices 37(12): 60-75 (2002) |
| 2001 |
| 40 | | Tim Sheard:
Generic Unification via Two-Level Types and Parameterized Modules.
ICFP 2001: 86-97 |
| 39 | EE | William L. Harrison,
Tim Sheard:
Dynamically Adaptable Software with Metacomputations in a Staged Language.
SAIG 2001: 163-182 |
| 38 | EE | Tim Sheard:
Accomplishments and Research Challenges in Meta-programming.
SAIG 2001: 2-44 |
| 2000 |
| 37 | EE | Walid Taha,
Tim Sheard:
MetaML and multi-stage programming with explicit annotations.
Theor. Comput. Sci. 248(1-2): 211-242 (2000) |
| 1999 |
| 36 | EE | Tim Sheard,
Zine-El-Abidine Benaissa,
Emir Pasalic:
DSL implementation using staging and monads.
DSL 1999: 81-94 |
| 35 | EE | Eugenio Moggi,
Walid Taha,
Zine-El-Abidine Benaissa,
Tim Sheard:
An Idealized MetaML: Simpler, and More Expressive.
ESOP 1999: 193-207 |
| 1998 |
| 34 | | Tim Sheard:
Using MetaML: A Staged Programming Language.
Advanced Functional Programming 1998: 207-239 |
| 33 | EE | Walid Taha,
Zine-El-Abidine Benaissa,
Tim Sheard:
Multi-Stage Programming: Axiomatization and Type Safety.
ICALP 1998: 918-929 |
| 32 | EE | Mark Shields,
Tim Sheard,
Simon L. Peyton Jones:
Dynamic Typing as Staged Type Inference.
POPL 1998: 289-302 |
| 1997 |
| 31 | | Walid Taha,
Tim Sheard:
Multi-Stage Programming.
ICFP 1997: 321 |
| 30 | EE | Walid Taha,
Tim Sheard:
Multi-Stage Programming with Explicit Annotations.
PEPM 1997: 203-217 |
| 29 | EE | Tim Sheard:
A Type-directed, On-line, Partial Evaluator for a Polymorphic Language.
PEPM 1997: 22-35 |
| 1996 |
| 28 | | John Launchbury,
Erik Meijer,
Tim Sheard:
Advanced Functional Programming, Second International School, Olympia, WA, USA, August 26-30, 1996, Tutorial Text
Springer 1996 |
| 27 | EE | Richard B. Kieburtz,
Laura McKinney,
Jeffrey M. Bell,
James Hook,
Alex Kotov,
Jeffrey Lewis,
Dino Oliva,
Tim Sheard,
Ira Smith,
Lisa Walton:
A Software Engineering Experiment in Software Component Generation.
ICSE 1996: 542-552 |
| 26 | EE | Leonidas Fegaras,
Tim Sheard:
Revisiting Catamorphisms over Datatypes with Embedded Functions (or, Programs from Outer Space).
POPL 1996: 284-294 |
| 1995 |
| 25 | | John Launchbury,
Tim Sheard:
Warm Fusion: Deriving Build-Cata's from Recursive Definitions.
FPCA 1995: 314-323 |
| 24 | | Richard B. Kieburtz,
Françoise Bellegarde,
Jeffrey M. Bell,
James Hook,
Jeffrey Lewis,
Dino Oliva,
Tim Sheard,
Lisa Walton,
Tong Zhou:
Calculating Software Generators from Solution Specifications.
TAPSOFT 1995: 546-560 |
| 1994 |
| 23 | | Leonidas Fegaras,
Tim Sheard,
Tong Zhou:
Improving Programs Which Recurse over Multiple Inductive Structures.
PEPM 1994: 21-32 |
| 22 | EE | Jeffrey M. Bell,
Françoise Bellegarde,
James Hook,
Richard B. Kieburtz,
Alex Kotov,
Jeffrey Lewis,
Laura McKinney,
Dino Oliva,
Tim Sheard,
L. Tong,
Lisa Walton,
Tong Zhou:
Software design for reliability and reuse: a proof-of-concept demonstration.
TRI-Ada 1994: 396-404 |
| 1993 |
| 21 | | Tim Sheard:
Increasing the Level of Abstraction in Traditional Functional Languages by Using Compile-time Reflection.
AMAST 1993: 145-152 |
| 20 | | Leonidas Fegaras,
David Maier,
Tim Sheard:
Specifying Rule-Based Query Optimizers in a Reflective Framework.
DOOD 1993: 146-168 |
| 19 | | Tim Sheard,
Leonidas Fegaras:
A Fold for All Seasons.
FPCA 1993: 233-242 |
| 1992 |
| 18 | | Leonidas Fegaras,
Tim Sheard,
David W. Stemple:
Uniform Traversal Combinators: Definition, Use and Properties.
CADE 1992: 148-162 |
| 17 | | Tim Sheard,
David W. Stemple:
Inheritance of Theory in the Adabtpl Language.
Comput. Lang. 17(3): 157-167 (1992) |
| 1991 |
| 16 | EE | Tim Sheard:
Automatic Generation and Use of Abstract Structure Operators.
ACM Trans. Program. Lang. Syst. 13(4): 531-557 (1991) |
| 1990 |
| 15 | EE | David W. Stemple,
Leonidas Fegaras,
Tim Sheard,
Adolfo Socorro:
Exceeding the Limits of Polymorphism in Database Programming Languages.
EDBT 1990: 269-285 |
| 14 | | David W. Stemple,
Tim Sheard:
A Recursive Base for Database Programming Primitives.
East/West Database Workshop 1990: 311-332 |
| 1989 |
| 13 | EE | Leonidas Fegaras,
Tim Sheard,
David W. Stemple:
The ADABTPL Type System.
DBPL 1989: 207-218 |
| 12 | EE | Tim Sheard,
David W. Stemple:
Automatic Verification of Database Transaction Safety.
ACM Trans. Database Syst. 14(3): 322-368 (1989) |
| 1988 |
| 11 | EE | Tim Sheard,
David W. Stemple:
The precise control of inheritance and the inheritance of theory in the ADABTPL language.
ICCL 1988: 194-201 |
| 10 | | David W. Stemple,
Adolfo Socorro,
Tim Sheard:
Formalizing Objects for Databases using ADABTPL.
OODBS 1988: 110-128 |
| 9 | EE | Subhasish Mazumdar,
David W. Stemple,
Tim Sheard:
Resolving the Tension between Integrity and Security Using a Theorem Prover.
SIGMOD Conference 1988: 233-242 |
| 1987 |
| 8 | EE | David W. Stemple,
Tim Sheard:
Construction and Calculus of Types for Database Systems.
DBPL 1987: 3-22 |
| 7 | EE | David W. Stemple,
Subhasish Mazumdar,
Tim Sheard:
On the Modes and Meaning of Feedback to Transaction Designers.
SIGMOD Conference 1987: 374-386 |
| 1986 |
| 6 | EE | David W. Stemple,
Tim Sheard,
Ralph E. Bunker:
Abstract Data Types in Databases: Specification, Manipulation and Access.
ICDE 1986: 590-597 |
| 5 | EE | David W. Stemple,
Tim Sheard,
Ralph E. Bunker:
Incorporating theory into database system development.
Inf. Process. Manage. 22(4): 317-330 (1986) |
| 1985 |
| 4 | | David W. Stemple,
Tim Sheard:
Database Theory for Supporting Specification-Based Database Systems Development.
ICSE 1985: 43-49 |
| 3 | EE | Tim Sheard,
David W. Stemple:
Coping with Complexity in Automated Reasoning about Database Systems.
VLDB 1985: 426-435 |
| 1984 |
| 2 | EE | David W. Stemple,
Tim Sheard:
Specification and Verification of Abstract Database Types.
PODS 1984: 248-257 |
| 1983 |
| 1 | | David W. Stemple,
Krithi Ramamritham,
Stephen Vinter,
Tim Sheard:
Operating System Support for Abstract Data(base) Types.
ICOD 1983: 179-195 |