scientific article; zbMATH DE number 1142318
From MaRDI portal
Publication:4385534
zbMath0900.68122MaRDI QIDQ4385534
Publication date: 14 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Logical relations and parametricity -- a Reynolds programme for category theory and programming languages, Mechanizing logical relations, Categorial graphs, Functional sorts in data type specifications, Data refinement, call by value and higher order programs, Full abstraction for the second order subset of an Algol-like language, A principled, complete, and efficient representation of C++, Linear Läuchli semantics, Termination of system \(F\)-bounded: A complete proof, Singleton, union and intersection types for program extraction, Intuitive counterexamples for constructive fallacies, The definition of Extended ML: A gentle introduction, A refined interpretation of intuitionistic logic by means of atomic polymorphism, Typed operational semantics for higher-order subtyping., On the Cognitive and Theoretical Foundations of Big Data Science and Engineering, On phase semantics and denotational semantics in multiplicative-additive linear logic, On behavioural abstraction and behavioural satisfaction in higher-order logic, A combinatory logic approach to higher-order E-unification, Proof-theoretic notions for software maintenance, Logic, logics, and logicism, Type system in programming languages, Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators, Category Theoretic Models of Data Refinement, On abstraction and the expressive power of programming languages, Type-directed specialization of polymorphism., Bisimilarity of open terms., Equality between functionals in the presence of coproducts, Soundness of data refinement for a higher-order imperative language, Annotation inference for modular checkers
