Skip to content
<title>Channels - General Bindings and Alpha-Equivalence in Nominal Isabelle :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
General Bindings and Alpha-Equivalence in Nominal Isabelle
Search for more channels:
Similar Items: General Bindings and Alpha-Equivalence in Nominal Isabelle
Channel Options
View Record
Explore related channels
Quick Look
Full abstraction for nominal general references
Quick Look
Completeness of Nominal PROPs
Quick Look
Automata theory in nominal sets
Quick Look
A dependent nominal type theory
Quick Look
Rule Formats for Nominal Process Calculi
Quick Look
On Nominal Syntax and Permutation Fixed Points
Quick Look
Modal Logics for Nominal Transition Systems
Quick Look
Residuality and Learning for Nondeterministic Nominal Automata
Quick Look
Formalising the pi-calculus using nominal logic
Quick Look
Constraint solving in non-permutative nominal abstract syntax
Quick Look
Nominal Coalgebraic Data Types with Applications to Lambda Calculus
Quick Look
From nominal to higher-order rewriting and back again
Quick Look
Behavioural equivalences for timed systems
Quick Look
On the Strong Equivalences for LPMLN Programs
Quick Look
Psi-calculi: a framework for mobile processes with nominal data and logic
Quick Look
Qualitative Logics and Equivalences for Probabilistic Systems
Quick Look
Proof equivalence in MLL is PSPACE-complete
Quick Look
Beyond Language Equivalence on Visibly Pushdown Automata
Quick Look
On the Complexity of Equivalence and Minimisation for Q-weighted Automata
Quick Look
Bisimulations Meet PCTL Equivalences for Probabilistic Automata
Quick Look
A Reduced Semantics for Deciding Trace Equivalence
Quick Look
2-adjoint equivalences in homotopy type theory
Quick Look
Equivalence checking for weak bi-Kleene algebra
Quick Look
Variable binding and substitution for (nameless) dummies
Load more items
View Record
Prev
Explore related channels
Next
