scientific article
From MaRDI portal
Publication:3664454
zbMath0516.68064MaRDI QIDQ3664454
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Semantics in the theory of computing (68Q55) Applications of computability and recursion theory (03D80) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)
Related Items
Universal profinite domains, Two-level semantics and code generation, A safe approach to parallel combinator reduction, Fully abstract submodels of typed lambda calculi, Fixed points and closure operators: Programmological aspects, From intervals to domains: towards a general description of validated uncertainty, with potential applications to geospatial and meteorological data, Effective inseparability in a topological setting, An abstract interpretation for ML equality kinds, Apartness, sharp elements, and the Scott topology of domains, Two-level semantics and abstract interpretation, A categorial approach to the theory of computation, Domain interpretations of Martin-Löf's partial type theory, Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation, Parametric \(\lambda \)-theories, Cartesian closed categories of algebraic cpos, Coherence and consistency in domains, A ``geometric view of the dynamics of trajectories of computer programs, Categorical fixed point semantics, Kleene chain completeness and fixedpoint properties, Closures and fairness in the semantics of programming logic, On a generalized product for domains, Type inference, abstract interpretation and strictness analysis
