Pages that link to "Item:Q1249567"
From MaRDI portal
The following pages link to Fully abstract models of typed \(\lambda\)-calculi (Q1249567):
Displaying 50 items.
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases (Q478400) (← links)
- A fully abstract may testing semantics for concurrent objects (Q557787) (← links)
- Behavioural theories and the proof of behavioural properties (Q671500) (← links)
- Fully abstract compositional semantics for an algebra of logic programs (Q672703) (← links)
- Modal logic and algebraic specifications (Q685423) (← links)
- On stable domains (Q685428) (← links)
- The semantics of second-order lambda calculus (Q751294) (← links)
- Distributive semantics for nondeterministic typed \(\lambda\)-calculi (Q760418) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- The extensional ordering of the sequential functionals (Q764278) (← links)
- The insensitivity theorem for nonreducing reflexive types (Q792755) (← links)
- A systematic study of models of abstract data types (Q801667) (← links)
- From IF to BI. A tale of dependence and separation (Q833040) (← links)
- On generic context lemmas for higher-order calculi with sharing (Q960863) (← links)
- Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi (Q964003) (← links)
- On the observational theory of the CPS-calculus (Q968276) (← links)
- The equational theory of prebisimilarity over basic CCS with divergence (Q975471) (← links)
- Operational domain theory and topology of sequential programming languages (Q1013087) (← links)
- Abstract interface behavior of object-oriented languages with monitors (Q1015384) (← links)
- Natural non-dcpo domains and f-spaces (Q1023300) (← links)
- Structured algebraic specifications: A kernel language (Q1080652) (← links)
- About fair asynchrony (Q1085603) (← links)
- Fully abstract submodels of typed lambda calculi (Q1095880) (← links)
- Parameter-reduction of higher level grammars (Q1099634) (← links)
- Partial ordering models for concurrency can be defined operationally (Q1111013) (← links)
- Full abstraction and limiting completeness in equational languages (Q1121676) (← links)
- A mathematical semantics for a nondeterministic typed lambda-calculus (Q1152949) (← links)
- Partial abstract types (Q1169290) (← links)
- Sequential algorithms on concrete data structures (Q1170880) (← links)
- Domain theory in logical form (Q1174593) (← links)
- Correctness of concurrent processes (Q1176236) (← links)
- Towards a semantics-based information theory (Q1179806) (← links)
- Towards a theory of parallel algorithms on concrete data structures (Q1194326) (← links)
- Principal types of BCK-lambda-terms (Q1208417) (← links)
- The typed lambda-calculus is not elementary recursive (Q1259590) (← links)
- On an effective hierarchy of communicating processes: Separation principle and testing (Q1269918) (← links)
- Decidability of behavioural equivalence in unary PCF (Q1285665) (← links)
- Historical introduction to ``Concrete domains'' by G. Kahn and G. D. Plotkin (Q1314353) (← links)
- Stability, sequentiality and demand driven evaluation in dataflow (Q1346605) (← links)
- On reduction-based process semantics (Q1350347) (← links)
- Full abstraction for the second order subset of an Algol-like language (Q1369235) (← links)
- A first order logic of effects (Q1390955) (← links)
- Proof systems for structured specifications with observability operators (Q1391730) (← links)
- Fully abstract trace semantics for protected module architectures (Q1749116) (← links)
- Axioms for strict and lazy functional programs (Q1772783) (← links)
- Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus (Q1813498) (← links)
- The sequentially realizable functionals (Q1849853) (← links)
- A relative PCF-definability result for strongly stable functions and some corollaries (Q1854294) (← links)
- Games and full abstraction for FPC. (Q1854351) (← links)
- Full abstraction for PCF (Q1854394) (← links)
