Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Stellar Resolution: Multiplicatives

Abstract : We present a new asynchronous model of computation named Stellar Resolution based on first-order unification. This model of computation is obtained as a formalisation of Girard's transcendental syntax programme, sketched in a series of three articles. As such, it is the first step towards a proper formal treatment of Girard's proposal to tackle first-order logic in a proofs-as-program approach. After establishing formal definitions and basic properties of stellar resolution, we explain how it generalises traditional models of computation, such as logic programming and combinatorial models such as Wang tilings. We then explain how it can represent multiplicative proof-structures, their cut-elimination and the correctness criterion of Danos and Regnier. Further use of realisability techniques lead to dynamic semantics for Multiplicative Linear Logic, following previous Geometry of Interaction models.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [62 references]  Display  Hide  Download
Contributor : Thomas Seiller <>
Submitted on : Thursday, July 30, 2020 - 9:13:12 PM
Last modification on : Tuesday, October 20, 2020 - 3:37:42 AM


Files produced by the author(s)


  • HAL Id : hal-02895111, version 2
  • ARXIV : 2007.16077



Boris Eng, Thomas Seiller. Stellar Resolution: Multiplicatives. 2020. ⟨hal-02895111v2⟩



Record views


Files downloads