James McKinna

Orcid: 0000-0001-6745-2560

According to our database1, James McKinna authored at least 43 papers between 1993 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Forward- or reverse-mode automatic differentiation: What's the difference?
Sci. Comput. Program., January, 2024

2023
Structural Subtyping as Parametric Polymorphism.
Proc. ACM Program. Lang., October, 2023

2019
Abstracting extensible data types: or, rows by any other name.
Proc. ACM Program. Lang., 2019

2018
A type and scope safe universe of syntaxes with binding: their semantics and proofs.
Proc. ACM Program. Lang., 2018

Triangulating context lemmas.
Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2018

2017
On principles of Least Change and Least Surprise for bidirectional transformations.
J. Object Technol., 2017

Coalgebraic Aspects of Bidirectional Computation.
J. Object Technol., 2017

Type-and-scope safe programs and their proofs.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2016
How to Regain Equilibrium without Losing your Balance? Scenarios for Bx Deployment (Discussion Paper).
Proceedings of the 5th International Workshop on Bidirectional Transformations, 2016

Complements Witness Consistency.
Proceedings of the 5th International Workshop on Bidirectional Transformations, 2016

Bidirectional Transformations with Deltas: A Dependently Typed Approach (Talk Proposal).
Proceedings of the 5th International Workshop on Bidirectional Transformations, 2016

Reflections on Monadic Lenses.
Proceedings of the A List of Successes That Can Change the World, 2016

Introduction to Bidirectional Transformations.
Proceedings of the Bidirectional Transformations, 2016

2015
Towards a Principle of Least Surprise for Bidirectional Transformations.
Proceedings of the 4th International Workshop on Bidirectional Transformations co-located with Software Technologies: Applications and Foundations, 2015

Notions of Bidirectional Computation and Entangled State Monads.
Proceedings of the Mathematics of Program Construction - 12th International Conference, 2015

2014
Entangled State Monads.
Proceedings of the Workshops of the EDBT/ICDT 2014 Joint Conference (EDBT/ICDT 2014), 2014

Towards a Repository of Bx Examples.
Proceedings of the Workshops of the EDBT/ICDT 2014 Joint Conference (EDBT/ICDT 2014), 2014

2013
The <i>λ</i><i>μ</i><sup><i>T</i></sup>-calculus.
Ann. Pure Appl. Log., 2013


2012
The lambda-mu-T-calculus
CoRR, 2012

2011
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Log. Methods Comput. Sci., 2011

Dynamic Proof Pages.
Proceedings of the ITP 2011 Workshop on Mathematical Wikis, 2011

2010
Narrating Formal Proof (Work in Progress).
Proceedings of the 9th International Workshop On User Interfaces for Theorem Provers, 2010

Pure Type Systems without Explicit Contexts
Proceedings of the Proceedings 5th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice, 2010

Type Inference in Context.
Proceedings of the 3rd ACM SIGPLAN Workshop on Mathematically Structured Functional Programming, 2010

Proviola: A Tool for Proof Re-animation.
Proceedings of the Intelligent Computer Mathematics, 10th International Conference, 2010

2009
A Logically Saturated Extension of lambdaµµ.
Proceedings of the Intelligent Computer Mathematics, 2009

Domain Specific Languages (DSLs) for Network Protocols (Position Paper).
Proceedings of the 29th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2009 Workshops), 2009

2008
A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq.
Proceedings of the Types for Proofs and Programs, International Conference, 2008

A Real Semantic Web for Mathematics Deserves a Real Semantics.
Proceedings of the 3rd Semantic Wiki Workshop (SemWiki 2008) at the 5th European Semantic Web Conference (ESWC 2008), 2008

Mechanising a Proof of Craig's Interpolation Theorem for Intuitionistic Logic in Nominal Isabelle.
Proceedings of the Intelligent Computer Mathematics, 9th International Conference, 2008

2007
Constructing Correct Circuits: Verification of Functional Aspects of Hardware Specifications with Dependent Types.
Proceedings of the Eighth Symposium on Trends in Functional Programming, 2007

2006
Why dependent types matter.
Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2006

A Sequent Calculus for Type Theory.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Eliminating Dependent Pattern Matching.
Proceedings of the Algebra, Meaning, and Computation, 2006

2004
The view from the left.
J. Funct. Program., 2004

A Few Constructions on Constructors.
Proceedings of the Types for Proofs and Programs, International Workshop, 2004

Functional pearl: i am not a number-i am a free variable.
Proceedings of the ACM SIGPLAN Workshop on Haskell, 2004

2003
Inductive Families Need Not Store Their Indices.
Proceedings of the Types for Proofs and Programs, International Workshop, 2003

1999
Some Lambda Calculus and Type Theory Formalized.
J. Autom. Reason., 1999

1993
Checking Algorithms for Pure Type Systems.
Proceedings of the Types for Proofs and Programs, 1993

Pure Type Systems Formalized.
Proceedings of the Typed Lambda Calculi and Applications, 1993

Deliverables: A Categorial Approach to Program Development in Type Theory.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993


  Loading...