Initial Algebras of Terms with Binding and Algebraic Structure
DOI10.1007/978-3-642-54789-8_12zbMath1285.18004OpenAlexW1747768416MaRDI QIDQ5414966
Publication date: 8 May 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.822.8321
Algebraic theory of languages and automata (68Q70) Categorical logic, topoi (03G30) Theories (e.g., algebraic theories), structure, and semantics (18C10) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Presheaves and sheaves, stacks, descent conditions (category-theoretic aspects) (18F20) Functor categories, comma categories (18A25) Eilenberg-Moore and Kleisli constructions for monads (18C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bialgebras for structural operational semantics: an introduction
- Categorical logic and type theory
- Semantics of weakening and contraction
- Universal coalgebra: A theory of systems
- Comparing operational models of name-passing process calculi
- Nondeterministic extensions of untyped \(\lambda\)-calculus
- A fixpoint theorem for complete categories
- Non-Deterministic Kleene Coalgebras
- Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
- When Is a Type Refinement an Inductive Type?
- Linearly-Used State in Models of Call-by-Value
- Nominal Kleene Coalgebra
- Solvability in Resource Lambda-Calculus
- Initial Algebra Semantics and Continuous Algebras
- Generic Trace Semantics via Coinduction
- Closed categories generated by commutative monads
- Bilinearity and Cartesian Closed Monads.
- A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
- Bases as Coalgebras
This page was built for publication: Initial Algebras of Terms with Binding and Algebraic Structure
