The following pages link to Towards nominal computation (Q2942888):
Displaying 16 items.
- Model checking Petri nets with names using data-centric dynamic systems (Q315291) (← links)
- Nominal monoids (Q372971) (← links)
- PNL to HOL: from the logic of nominal sets to the logic of higher-order functions (Q714797) (← links)
- Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness (Q730088) (← links)
- Simple and subdirectly irreducible finitely supported \(Cb\)-sets (Q1680555) (← links)
- Contribution of Warsaw logicians to computational logic (Q2422533) (← links)
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture (Q2822649) (← links)
- Validating Brouwer's continuity principle for numbers using named exceptions (Q4640313) (← links)
- (Q5013828) (← links)
- (Q5028487) (← links)
- (Q5089311) (← links)
- (Q5207051) (← links)
- Denotational Semantics with Nominal Scott Domains (Q5501931) (← links)
- Fast computations on ordered nominal sets (Q5918532) (← links)
- WQO dichotomy for 3-graphs (Q5919047) (← links)
- A Theory of Formal Choreographic Languages (Q6135778) (← links)
