scientific article; zbMATH DE number 1142318

Cited in

(31)

Full abstraction for the second order subset of an Algol-like language
Termination of system F-bounded: A complete proof
The definition of Extended ML: A gentle introduction
Typed operational semantics for higher-order subtyping.
Soundness of data refinement for a higher-order imperative language
Annotation inference for modular checkers
Type-directed specialization of polymorphism.
Bisimilarity of open terms.
Equality between functionals in the presence of coproducts
Data refinement, call by value and higher order programs
Linear Läuchli semantics
On phase semantics and denotational semantics in multiplicative-additive linear logic
A refined interpretation of intuitionistic logic by means of atomic polymorphism
Logical relations and parametricity -- a Reynolds programme for category theory and programming languages
A principled, complete, and efficient representation of C++
On the cognitive and theoretical foundations of big data science and engineering
Proof-theoretic notions for software maintenance
Category theoretic models of data refinement
Categorial graphs
Functional sorts in data type specifications
On abstraction and the expressive power of programming languages
Singleton, union and intersection types for program extraction
Intuitive counterexamples for constructive fallacies
Mechanizing logical relations
Logic, logics, and logicism
Type system in programming languages
Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators
Correcting type errors in the Curry system
On behavioural abstraction and behavioural satisfaction in higher-order logic
A combinatory logic approach to higher-order E-unification
The autonomous data language -- concepts, design and formal verification

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385534)