Towards nominal computation
From MaRDI portal
Publication:2942888
DOI10.1145/2103656.2103704zbMath1321.68139OpenAlexW4251967880MaRDI QIDQ2942888
Bartek Klin, Laurent Braud, Mikołaj Bojańczyk, Sławomir Lasota
Publication date: 11 September 2015
Published in: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.301.7681
Formal languages and automata (68Q45) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)
Related Items
Model checking Petri nets with names using data-centric dynamic systems ⋮ Unnamed Item ⋮ Nominal monoids ⋮ Simple and subdirectly irreducible finitely supported \(Cb\)-sets ⋮ Contribution of Warsaw logicians to computational logic ⋮ A Theory of Formal Choreographic Languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Validating Brouwer's continuity principle for numbers using named exceptions ⋮ PNL to HOL: from the logic of nominal sets to the logic of higher-order functions ⋮ Unnamed Item ⋮ Fast computations on ordered nominal sets ⋮ WQO dichotomy for 3-graphs ⋮ Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness ⋮ Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture ⋮ Denotational Semantics with Nominal Scott Domains
