activity
19972022
most citedContraction-free proofs and finitary games for Linear Logic

4 citations · 16 across the 14 of their papers we have counts for

collaborators

14 papers

cs.LO2022★ 1 cited

Variable binding and substitution for (nameless) dummies

André Hirschowitz, Tom Hirschowitz, Ambroise Lafont +1

By abstracting over well-known properties of De Bruijn's representation with nameless dummies, we design a new theory of syntax with variable binding and capture-avoiding substitut…

cs.PL2020★ 3 cited

Modules over monads and operational semantics (expanded version)

André Hirschowitz, Tom Hirschowitz, Ambroise Lafont

This paper is a contribution to the search for efficient and high-level mathematical tools to specify and reason about (abstract) programming languages or calculi. Generalising the…

cs.PL2019★ 2 cited

Reduction Monads and Their Signatures

Benedikt Ahrens, André Hirschowitz, Ambroise Lafont +1

In this work, we study 'reduction monads', which are essentially the same as monads relative to the free functor from sets into multigraphs. Reduction monads account for two aspect…

cs.LO2019★ 2 cited

Modular specification of monads through higher-order presentations

Benedikt Ahrens, André Hirschowitz, Ambroise Lafont +1

In their work on second-order equational logic, Fiore and Hur have studied presentations of simply typed languages by generating binding constructions and equations among them. To…

cs.LO2018★ 1 cited

Presentable signatures and initial semantics

Benedikt Ahrens, André Hirschowitz, Ambroise Lafont +1

We present a device for specifying and reasoning about syntax for datatypes, programming languages, and logic calculi. More precisely, we study a notion of "signature" for specifyi…

math.GN2012

Saturating directed spaces

André Hirschowitz, Michel Hirschowitz, Tom Hirschowitz

Directed topology is a refinement of standard topology, where spaces may have non-reversible paths. It has been put forward as a candidate approach to the analysis of concurrent pr…