Karl Crary

Orcid: 0000-0002-1556-2183

Affiliations:
  • Carnegie Mellon University, Pittsburgh, USA


According to our database1, Karl Crary authored at least 54 papers between 1997 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Verifying the Hashgraph Consensus Algorithm.
CoRR, 2021

2020
A focused solution to the avoidance problem.
J. Funct. Program., 2020

2019
Fully abstract module compilation.
Proc. ACM Program. Lang., 2019

Compiling a Calculus for Relaxed Memory: Practical constraint-based low-level concurrency.
CoRR, 2019

2018
Hygienic Source-Code Generation Using Functors.
CoRR, 2018

TWAM: A Certifying Abstract Machine for Logic Programs.
Proceedings of the Verified Software. Theories, Tools, and Experiments, 2018

Hygienic Source-Code Generation Using Functors - (Extended Abstract).
Proceedings of the Practical Aspects of Declarative Languages, 2018

Strong Sums in Focused Logic.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
Modules, abstraction, and parametric polymorphism.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

2015
A Calculus for Relaxed Memory.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Peer-to-peer affine commitment using bitcoin.
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015

2010
Higher-order representation of substructural logics.
Proceedings of the Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, 2010

2009
A syntactic account of singleton types via hereditary substitution.
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2009

2008
Foundational certified code in the Twelf metalogical framework.
ACM Trans. Comput. Log., 2008

Explicit Contexts in LF (Extended Abstract).
Proceedings of the International Workshop on Logical Frameworks and Metalanguages: Theory and Practice, 2008

2007
Sound and complete elimination of singleton kinds.
ACM Trans. Comput. Log., 2007

Syntactic Logical Relations for Polymorphic and Recursive Types.
Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

Type-Safe Distributed Programming with ML5.
Proceedings of the Trustworthy Global Computing, Third Symposium, 2007

Towards a mechanized metatheory of standard ML.
Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2007

2006
Higher-order abstract syntax: setting the record straight.
SIGACT News, 2006

Logic Column 16: Higher-Order Abstract Syntax: Setting the Record Straight
CoRR, 2006

A separate compilation extension to standard ML.
Proceedings of the ACM Workshop on ML, 2006, Portland, Oregon, USA, September 16, 2006, 2006

2005
A monadic analysis of information flow security with mutable state.
J. Funct. Program., 2005

Automated and certified conformance to responsiveness policies.
Proceedings of TLDI'05: 2005 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, 2005

Small Proof Witnesses for LF.
Proceedings of the Logic Programming, 21st International Conference, 2005

Distributed Control Flow with Classical Modal Logic.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2004
A Symmetric Modal Lambda Calculus for Distributed Computing.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2003
Automated techniques for provably safe mobile code.
Theor. Comput. Sci., 2003

Typed compilation of recursive datatypes.
Proceedings of TLDI'03: 2003 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, 2003

A typed interface for garbage collection.
Proceedings of TLDI'03: 2003 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, 2003

A type theory for memory allocation and data layout.
Proceedings of the Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003

A type system for higher-order modules.
Proceedings of the Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003

Toward a foundational typed assembly language.
Proceedings of the Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003

Foundational Certified Code in a Metalogical Framework.
Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 2003

2002
Stack-based typed assembly language.
J. Funct. Program., 2002

Intensional polymorphism in type-erasure semantics.
J. Funct. Program., 2002

A Simplified Account of the Metatheory of Linear LF.
Proceedings of the International Workshop on Logical Frameworks and Meta-Languages, 2002

An expressive, scalable type theory for certified code.
Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP '02), 2002

Trustless Grid Computing in ConCert.
Proceedings of the Grid Computing, 2002

2001
Persistent triangulations Journal of Functional Programming.
J. Funct. Program., 2001

2000
Typed memory management via static capabilities.
ACM Trans. Program. Lang. Syst., 2000

Safe and Flexible Dynamic Linking of Native Code.
Proceedings of the Types in Compilation, Third International Workshop, 2000

Resource Bound Certification.
Proceedings of the POPL 2000, 2000

Typed compilation of inclusive subtyping.
Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP '00), 2000

1999
From system F to typed assembly language.
ACM Trans. Program. Lang. Syst., 1999

Typed Memory Management in a Calculus of Capabilities.
Proceedings of the POPL '99, 1999

What is a Recursive Module?
Proceedings of the 1999 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 1999

Flexible Type Analysis.
Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), 1999

A Simple Proof Technique for Certain Parametricity Results.
Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), 1999

Type Structure for Low-Level Programming Languages.
Proceedings of the Automata, 1999

1998
Type-Theoretic Methodology for Practical Programming Languages.
PhD thesis, 1998

Programming language semantics in foundational type theory.
Proceedings of the Programming Concepts and Methods, 1998

Admissibility of Fixpoint Induction over Partial Types.
Proceedings of the Automated Deduction, 1998

1997
Foundations for the Implementation of Higher-Order Subtyping.
Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP '97), 1997


  Loading...