default search action
Karl Crary
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [i5]Karl Crary:
Verifying the Hashgraph Consensus Algorithm. CoRR abs/2102.01167 (2021) - 2020
- [j13]Karl Crary
:
A focused solution to the avoidance problem. J. Funct. Program. 30: e24 (2020)
2010 – 2019
- 2019
- [j12]Karl Crary:
Fully abstract module compilation. Proc. ACM Program. Lang. 3(POPL): 10:1-10:29 (2019) - [i4]Michael J. Sullivan, Karl Crary, Salil Joshi:
Compiling a Calculus for Relaxed Memory: Practical constraint-based low-level concurrency. CoRR abs/1904.05389 (2019) - 2018
- [c41]Karl Crary:
Strong Sums in Focused Logic. LICS 2018: 265-274 - [c40]Karl Crary
Hygienic Source-Code Generation Using Functors - (Extended Abstract). PADL 2018: 53-60 - [c39]Rose Bohrer
TWAM: A Certifying Abstract Machine for Logic Programs. VSTTE 2018: 112-134 - [i3]Rose Bohrer, Karl Crary:
TWAM: A Certifying Abstract Machine for Logic Programs. CoRR abs/1801.00471 (2018) - [i2]Karl Crary:
Hygienic Source-Code Generation Using Functors. CoRR abs/1801.01579 (2018) - 2017
- [c38]Karl Crary:
Modules, abstraction, and parametric polymorphism. POPL 2017: 100-113 - 2015
- [c37]Karl Crary, Michael J. Sullivan
Peer-to-peer affine commitment using bitcoin. PLDI 2015: 479-488 - [c36]Karl Crary, Michael J. Sullivan
A Calculus for Relaxed Memory. POPL 2015: 623-636 - 2010
- [c35]Karl Crary:
Higher-order representation of substructural logics. ICFP 2010: 131-142 - [e1]Karl Crary, Marino Miculan
Proceedings 5th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice, LFMTP 2010, Edinburgh, UK, 14th July 2010. EPTCS 34, 2010 [contents]
2000 – 2009
- 2009
- [c34]Karl Crary:
A syntactic account of singleton types via hereditary substitution. LFMTP 2009: 21-29 - 2008
- [j11]Karl Crary, Susmit Sarkar
Foundational certified code in the Twelf metalogical framework. ACM Trans. Comput. Log. 9(3): 16:1-16:26 (2008) - [c33]Karl Crary:
Explicit Contexts in LF (Extended Abstract). LFMTP@LICS 2008: 53-68 - 2007
- [j10]Karl Crary:
Sound and complete elimination of singleton kinds. ACM Trans. Comput. Log. 8(2): 8 (2007) - [c32]Daniel K. Lee, Karl Crary, Robert Harper:
Towards a mechanized metatheory of standard ML. POPL 2007: 173-184 - [c31]Tom Murphy VII, Karl Crary, Robert Harper:
Type-Safe Distributed Programming with ML5. TGC 2007: 108-123 - [c30]Karl Crary, Robert Harper:
Syntactic Logical Relations for Polymorphic and Recursive Types. Computation, Meaning, and Logic 2007: 259-299 - 2006
- [j9]Karl Crary, Robert Harper:
Higher-order abstract syntax: setting the record straight. SIGACT News 37(3): 93-96 (2006) - [c29]David Swasey, Tom Murphy VII, Karl Crary, Robert Harper:
A separate compilation extension to standard ML. ML 2006: 32-42 - [i1]Karl Crary, Robert Harper:
Logic Column 16: Higher-Order Abstract Syntax: Setting the Record Straight. CoRR abs/cs/0607141 (2006) - 2005
- [j8]Karl Crary, Aleksey Kliger, Frank Pfenning:
A monadic analysis of information flow security with mutable state. J. Funct. Program. 15(2): 249-291 (2005) - [c28]Tom Murphy VII, Karl Crary, Robert Harper:
Distributed Control Flow with Classical Modal Logic. CSL 2005: 51-69 - [c27]Susmit Sarkar
Small Proof Witnesses for LF. ICLP 2005: 387-401 - [c26]Joseph Vanderwaart, Karl Crary:
Automated and certified conformance to responsiveness policies. TLDI 2005: 79-90 - 2004
- [c25]Tom Murphy VII, Karl Crary, Robert Harper, Frank Pfenning:
A Symmetric Modal Lambda Calculus for Distributed Computing. LICS 2004: 286-295 - 2003
- [j7]J. Gregory Morrisett, Karl Crary, Neal Glew, David Walker
Stack-based typed assembly language. J. Funct. Program. 13(5): 957-959 (2003) - [j6]Christopher Colby, Karl Crary, Robert Harper, Peter Lee, Frank Pfenning:
Automated techniques for provably safe mobile code. Theor. Comput. Sci. 290(2): 1175-1199 (2003) - [c24]Karl Crary, Susmit Sarkar
Foundational Certified Code in a Metalogical Framework. CADE 2003: 106-120 - [c23]Leaf Petersen, Robert Harper, Karl Crary, Frank Pfenning:
A type theory for memory allocation and data layout. POPL 2003: 172-184 - [c22]Karl Crary:
Toward a foundational typed assembly language. POPL 2003: 198-212 - [c21]Derek Dreyer, Karl Crary, Robert Harper:
A type system for higher-order modules. POPL 2003: 236-249 - [c20]Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, Karl Crary, Robert Harper, Perry Cheng:
Typed compilation of recursive datatypes. TLDI 2003: 98-108 - [c19]Joseph Vanderwaart, Karl Crary:
A typed interface for garbage collection. TLDI 2003: 109-122 - 2002
- [j5]J. Gregory Morrisett, Karl Crary, Neal Glew, David Walker
Stack-based typed assembly language. J. Funct. Program. 12(1): 3-88 (2002) - [j4]Karl Crary, Stephanie Weirich
Intensional polymorphism in type-erasure semantics. J. Funct. Program. 12(6): 567-600 (2002) - [c18]Bor-Yuh Evan Chang, Karl Crary, Margaret DeLap, Robert Harper, Jason Liszka, Tom Murphy VII, Frank Pfenning:
Trustless Grid Computing in ConCert. GRID 2002: 112-125 - [c17]Karl Crary, Joseph Vanderwaart:
An expressive, scalable type theory for certified code. ICFP 2002: 191-205 - [c16]Joseph Vanderwaart, Karl Crary:
A Simplified Account of the Metatheory of Linear LF. LFM 2002: 11-28 - 2001
- [j3]Guy E. Blelloch, Hal Burch, Karl Crary, Robert Harper, Gary L. Miller, Noel Walkington:
Persistent triangulations Journal of Functional Programming. J. Funct. Program. 11(5): 441-466 (2001) - 2000
- [j2]David Walker
Typed memory management via static capabilities. ACM Trans. Program. Lang. Syst. 22(4): 701-771 (2000) - [c15]Karl Crary:
Typed compilation of inclusive subtyping. ICFP 2000: 68-81 - [c14]Karl Crary, Stephanie Weirich:
Resource Bound Certification. POPL 2000: 184-198 - [c13]Karl Crary:
Sound and Complete Elimination of Singleton Kinds. Types in Compilation 2000: 1-26 - [c12]Michael W. Hicks
Safe and Flexible Dynamic Linking of Native Code. Types in Compilation 2000: 147-176
1990 – 1999
- 1999
- [j1]J. Gregory Morrisett, David Walker
From system F to typed assembly language. ACM Trans. Program. Lang. Syst. 21(3): 527-568 (1999) - [c11]Karl Crary, J. Gregory Morrisett:
Type Structure for Low-Level Programming Languages. ICALP 1999: 40-54 - [c10]Karl Crary:
A Simple Proof Technique for Certain Parametricity Results. ICFP 1999: 82-89 - [c9]Karl Crary, Stephanie Weirich:
Flexible Type Analysis. ICFP 1999: 233-248 - [c8]Karl Crary, Robert Harper, Sidd Puri:
What is a Recursive Module? PLDI 1999: 50-63 - [c7]Karl Crary, David Walker
Typed Memory Management in a Calculus of Capabilities. POPL 1999: 262-275 - 1998
- [b1]Karl Crary:
Type-Theoretic Methodology for Practical Programming Languages. Cornell University, USA, 1998 - [c6]Karl Crary:
Admissibility of Fixpoint Induction over Partial Types. CADE 1998: 270-285 - [c5]Karl Crary, Stephanie Weirich, J. Gregory Morrisett:
Intensional Polymorphism in Type-Erasure Semantics. ICFP 1998: 301-312 - [c4]J. Gregory Morrisett, David Walker
From System F to Typed Assembly Language. POPL 1998: 85-97 - [c3]Karl Crary:
Programming language semantics in foundational type theory. PROCOMET 1998: 107-125 - [c2]J. Gregory Morrisett, Karl Crary, Neal Glew, David Walker
Stack-Based Typed Assembly Language. Types in Compilation 1998: 28-52 - 1997
- [c1]Karl Crary:
Foundations for the Implementation of Higher-Order Subtyping. ICFP 1997: 125-135
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: