Travelled to:1 × Canada
1 × Germany
1 × Hungary
1 × Portugal
1 × Romania
1 × Spain
1 × Sweden
1 × United Kingdom
2 × Denmark
2 × Italy
2 × Japan
4 × The Netherlands
8 × USA
Collaborated with:∅ D.W.Stemple W.Taha L.Fegaras N.Linger K.Y.Ahn S.Mazumdar Z.Benaissa T.Zhou N.Mishra-Linger W.L.Harrison J.Launchbury S.Weirich B.A.Yorgey E.Pasalic M.Shields S.L.P.Jones R.B.Kieburtz J.M.Bell J.Hook J.Lewis D.Oliva L.Walton M.P.Fiore A.M.Pitts E.Moggi F.Bellegarde L.McKinney A.Kotov H.Wu G.F.Diamos M.Aref S.Baxter M.Garland S.Yalamanchili I.Smith L.Tong
Talks about:type (11) program (8) stage (7) softwar (5) languag (4) databas (4) system (4) recurs (4) meta (4) use (4)
Person: Tim Sheard
DBLP: Sheard:Tim
Facilitated 1 volumes:
EdContributed to:
2014
2013
2011
2008
2007
2004
200220022001
2001
19991998
1998
199819971997
19961996
19951994
19941993
1992
198819871985
1985
1984
1995
20052008Wrote 34 papers:
- CGO-2014-WuDSABGY #execution #query #relational
- Red Fox: An Execution Environment for Relational Query Processing on GPUs (HW, GFD, TS, MA, SB, MG, SY), p. 44.
- TLCA-2013-AhnSFP #system f
- System F i (KYA, TS, MPF, AMP), pp. 15–30.
- ICFP-2011-AhnS #combinator #data type #induction #recursion
- A hierarchy of mendler style recursion combinators: taming inductive datatypes with negative occurrences (KYA, TS), pp. 234–246.
- ICFP-2011-WeirichYS #bound
- Binders unbound (SW, BAY, TS), pp. 333–345.
- FoSSaCS-2008-Mishra-LingerS #morphism #polymorphism #type system
- Erasure and Polymorphism in Pure Type Systems (NML, TS), pp. 350–364.
- CEFP-2007-SheardL #programming
- Programming in Ωmega (TS, NL), pp. 158–227.
- TACAS-2004-LingerS #analysis #constraints #ml #theorem proving #type inference
- Binding-Time Analysis for MetaML via Type Inference and Constraint Solving (NL, TS), pp. 266–279.
- ASIA-PEPM-2002-SheardL #analysis #search-based #using
- Search-based binding time analysis using type-directed pruning (TS, NL), pp. 20–31.
- ICFP-2002-PasalicTS #staged
- Tagless staged interpreters for typed languages (EP, WT, TS), pp. 218–229.
- ICFP-2001-Sheard #unification
- Generic Unification via Two-Level Types and Parameterized Modules (TS), pp. 86–97.
- SAIG-2001-HarrisonS #adaptation #staged
- Dynamically Adaptable Software with Metacomputations in a Staged Language (WLH, TS), pp. 163–182.
- SAIG-2001-Sheard #challenge #metaprogramming #research
- Accomplishments and Research Challenges in Meta-programming (TS), pp. 2–44.
- ESOP-1999-MoggiTBS #ml
- An Idealized MetaML: Simpler, and More Expressive (EM, WT, ZEAB, TS), pp. 193–207.
- AFP-1998-Sheard98 #ml #programming language #staged #using
- Using MetaML: A Staged Programming Language (TS), pp. 207–239.
- ICALP-1998-TahaBS #axiom #multi #programming #type safety
- Multi-Stage Programming: Axiomatization and Type Safety (WT, ZEAB, TS), pp. 918–929.
- POPL-1998-ShieldsSJ #dynamic typing #staged #type inference #type system
- Dynamic Typing as Staged Type Inference (MS, TS, SLPJ), pp. 289–302.
- ICFP-1997-TahaS #multi #programming
- Multi-Stage Programming (WT, TS), p. 321.
- PEPM-1997-Sheard #online #polymorphism
- A Type-directed, On-line, Partial Evaluator for a Polymorphic Language (TS), pp. 22–35.
- PEPM-1997-TahaS #multi #programming
- Multi-Stage Programming with Explicit Annotations (WT, TS), pp. 203–217.
- ICSE-1996-KieburtzMBHKLOSSW #component #empirical #generative #re-engineering
- A Software Engineering Experiment in Software Component Generation (RBK, LM, JMB, JH, AK, JL, DO, TS, IS, LW), pp. 542–552.
- POPL-1996-FegarasS #data type #embedded #morphism #source code
- Revisiting Catamorphisms over Datatypes with Embedded Functions (or, Programs from Outer Space) (LF, TS), pp. 284–294.
- FPCA-1995-LaunchburyS #recursion
- Warm Fusion: Deriving Build-Cata’s from Recursive Definitions (JL, TS), pp. 314–323.
- PEPM-1994-FegarasSZ #induction #multi #source code
- Improving Programs Which Recurse over Multiple Inductive Structures (LF, TS, TZ), pp. 21–32.
- TRI-Ada-1994-BellBHKKLMOSTWZ #concept #design #reliability #reuse
- Software design for reliability and reuse: a proof-of-concept demonstration (JMB, FB, JH, RBK, AK, JL, LM, DO, TS, LT, LW, TZ), pp. 396–404.
- FPCA-1993-SheardF
- A Fold for All Seasons (TS, LF), pp. 233–242.
- CADE-1992-FegarasSS #combinator #traversal
- Uniform Traversal Combinators: Definition, Use and Properties (LF, TS, DWS), pp. 148–162.
- SIGMOD-1988-MazumdarSS #proving #security #theorem proving #using
- Resolving the Tension between Integrity and Security Using a Theorem Prover (SM, DWS, TS), pp. 233–242.
- SIGMOD-1987-StempleMS #design #feedback #on the #transaction
- On the Modes and Meaning of Feedback to Transaction Designers (DWS, SM, TS), pp. 374–386.
- ICSE-1985-StempleS #database #development
- Database Theory for Supporting Specification-Based Database Systems Development (DWS, TS), pp. 43–49.
- VLDB-1985-SheardS #automation #complexity #database #reasoning
- Coping with Complexity in Automated Reasoning about Database Systems (TS, DWS), pp. 426–435.
- PODS-1984-StempleS #database #specification #verification
- Specification and Verification of Abstract Database Types (DWS, TS), pp. 248–257.
- TAPSOFT-1995-KieburtzBBHLOSWZ #generative #specification
- Calculating Software Generators from Solution Specifications (RBK, FB, JMB, JH, JL, DO, TS, LW, TZ), pp. 546–560.
- Haskell-2005-Sheard
- Putting curry-howard to work (TS), pp. 74–85.
- Haskell-2008-AhnS #algebra #data type #recursion #type system
- Shared subtypes: subtyping recursive parametrized algebraic data types (KYA, TS), pp. 75–86.