Jan Schwinghammer

According to our database, Jan Schwinghammer authored at least 23 papers between 2004 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2015

Observational program calculi and the correctness of translations.

Manfred Schmidt-Schauß, David Sabel, Joachim Niehren, Jan Schwinghammer

Theor. Comput. Sci., 2015

2013

A step-indexed Kripke model of hidden state.

Jan Schwinghammer, Lars Birkedal, François Pottier, Bernhard Reus, Kristian Støvring, Hongseok Yang

Math. Struct. Comput. Sci., 2013

Step-Indexed Relational Reasoning for Countable Nondeterminism.

Lars Birkedal, Ales Bizjak, Jan Schwinghammer

Log. Methods Comput. Sci., 2013

2012

First steps in synthetic guarded domain theory: step-indexing in the topos of trees

Lars Birkedal, Rasmus Ejlers Møgelberg, Jan Schwinghammer, Kristian Støvring

Log. Methods Comput. Sci., 2012

2011

Nested Hoare Triples and Frame Rules for Higher-order Store

Jan Schwinghammer, Lars Birkedal, Bernhard Reus, Hongseok Yang

Log. Methods Comput. Sci., 2011

Step-indexed kripke models over recursive worlds.

Lars Birkedal, Bernhard Reus, Jan Schwinghammer, Kristian Støvring, Jacob Thamsborg, Hongseok Yang

Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

A Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces.

Jan Schwinghammer, Lars Birkedal, Kristian Støvring

Proceedings of the Foundations of Software Science and Computational Structures, 2011

Step-Indexed Relational Reasoning for Countable Nondeterminism.

Jan Schwinghammer, Lars Birkedal

Proceedings of the Computer Science Logic, 2011

2010

A Semantic Foundation for Hidden State.

Jan Schwinghammer, Hongseok Yang, Lars Birkedal, François Pottier, Bernhard Reus

Proceedings of the Foundations of Software Science and Computational Structures, 2010

A Metric Model of Lambda Calculus with Guarded Recursion.

Lars Birkedal, Jan Schwinghammer, Kristian Støvring

Proceedings of the 7th Workshop on Fixed Points in Computer Science, 2010

2009

Coherence of subsumption for monadic types.

Jan Schwinghammer

J. Funct. Program., 2009

A Step-indexed Semantics of Imperative Objects

Catalin Hritcu, Jan Schwinghammer

Log. Methods Comput. Sci., 2009

Formalizing a strong normalization proof for Moggi's computational metalanguage: a case study in Isabelle/HOL-nominal.

Christian Doczkal, Jan Schwinghammer

Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2009

2008

Adequacy of Compositional Translations for Observational Semantics.

Manfred Schmidt-Schauß, Joachim Niehren, Jan Schwinghammer, David Sabel

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

A Simple Model of Separation Logic for Higher-Order Store.

Lars Birkedal, Bernhard Reus, Jan Schwinghammer, Hongseok Yang

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures.

Joachim Niehren, David Sabel, Manfred Schmidt-Schauß, Jan Schwinghammer

Proceedings of the 23rd Conference on the Mathematical Foundations of Programming Semantics, 2007

On Normalization by Evaluation for Object Calculi.

Jan Schwinghammer

Proceedings of the Types for Proofs and Programs, International Conference, 2007

2006

A concurrent lambda calculus with futures.

Joachim Niehren, Jan Schwinghammer, Gert Smolka

Theor. Comput. Sci., 2006

Denotational semantics for a program logic of objects.

Bernhard Reus, Jan Schwinghammer

Math. Struct. Comput. Sci., 2006

Separation Logic for Higher-Order Store.

Bernhard Reus, Jan Schwinghammer

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005

A Typed Semantics of Higher-Order Store and Subtyping.

Jan Schwinghammer

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

Denotational Semantics for Abadi and Leino's Logic of Objects.

Bernhard Reus, Jan Schwinghammer

Proceedings of the Programming Languages and Systems, 2005

2004

Effciently Computing the Density of Regular Languages.

Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen, Jan Schwinghammer

Proceedings of the LATIN 2004: Theoretical Informatics, 2004