André Hirschowitz

Orcid: 0000-0003-2523-1481

According to our database1, André Hirschowitz authored at least 18 papers between 1994 and 2022.

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

2022
Modules over monads and operational semantics (expanded version).
Log. Methods Comput. Sci., 2022

Variable binding and substitution for (nameless) dummies.
Proceedings of the Foundations of Software Science and Computation Structures, 2022

2021
Presentable signatures and initial semantics.
Log. Methods Comput. Sci., 2021

2020
Reduction monads and their signatures.
Proc. ACM Program. Lang., 2020

Modules over Monads and Operational Semantics.
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

2019
Modular Specification of Monads Through Higher-Order Presentations.
Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

2018
High-Level Signatures and Initial Semantics.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2015
Wild omega-Categories for the Homotopy Hypothesis in Type Theory.
Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

2012
Nested Abstract Syntax in Coq.
J. Autom. Reason., 2012

Initial Semantics for Strengthened Signatures
Proceedings of the Proceedings 8th Workshop on Fixed Points in Computer Science, 2012

2010
Modules over monads and initial semantics.
Inf. Comput., 2010

2009
Contraction-free Proofs and Finitary Games for Linear Logic.
Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

2008
Topological Observations on Multiplicative Additive Linear Logic
CoRR, 2008

2007
The algebraicity of the lambda-calculus
CoRR, 2007

Modules over Monads and Linearity.
Proceedings of the Logic, 2007

A Theory for Game Theories.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

1995
Higher-Order Abstract Syntax in Coq.
Proceedings of the Typed Lambda Calculi and Applications, 1995

1994
Higher-Order Abstract Syntax with Induction in Coq.
Proceedings of the Logic Programming and Automated Reasoning, 5th International Conference, 1994


  Loading...