The following pages link to (Q3728878):
Displayed 22 items.
- A note on the notation of recursion in process algebras (Q751295) (← links)
- A completeness result for a realisability semantics for an intersection type system (Q882122) (← links)
- Existential foundations of the composition paradigm (Q946731) (← links)
- Unsolvable algorithmic problems for semigroups, groups and rings (Q1117039) (← links)
- Enlargements of functional algebras for the lambda calculus (Q1129261) (← links)
- How to decide the lark (Q1208736) (← links)
- A finite equational axiomatization of the functional algebras for the lambda calculus (Q1283777) (← links)
- Composition structure of programmology (Q1288660) (← links)
- Some examples of non-existent combinators (Q1314364) (← links)
- A fuzzy language. (Q1426245) (← links)
- On the algebraic models of lambda calculus (Q1583488) (← links)
- Foundations of programmology (Q1592005) (← links)
- On finitely presented and free algebras of Cantor varieties (Q1847294) (← links)
- A typed resolution principle for deduction with conditional typing theory (Q1855225) (← links)
- The abstract variable-binding calculus (Q1896759) (← links)
- Programmological aspects of the fixed point method (Q1905214) (← links)
- Fixed points and closure operators: Programmological aspects (Q1907780) (← links)
- Multiple data structuring (Q2432992) (← links)
- Descriptological foundations of information technologies (Q2480512) (← links)
- Genericity and the \(\pi\)-calculus (Q2576663) (← links)
- Explicit substitutions (Q4939690) (← links)
- How to normalize the Jay (Q5940936) (← links)