scientific article; zbMATH DE number 1499102
From MaRDI portal
Publication:4501156
zbMath0946.03053MaRDI QIDQ4501156
Publication date: 3 September 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stabilitygamedefinabilitytyped lambda-calculusPCFrecursivenesscomputation modelsequentialitycomputable functionalsserialityhereditarily sequential functionals
Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40) Higher-type and set recursion theory (03D65)
Related Items (37)
Comparing hierarchies of types in models of linear logic ⋮ Adapting innocent game models for the Böhm tree \(\lambda\)-theory ⋮ Game semantics for dependent types ⋮ Intuitionistic games: determinacy, completeness, and normalization ⋮ Realizability for Peano arithmetic with winning conditions in HON games ⋮ Game semantics approach to higher-order complexity ⋮ Game theoretic analysis of call-by-value computation ⋮ Full abstraction for Reduced ML ⋮ A game semantics for disjunctive logic programming ⋮ Answer set programming in intuitionistic logic ⋮ Glueing and orthogonality for models of linear logic ⋮ Game semantics of Martin-Löf type theory ⋮ Totality in arena games ⋮ Game-theoretic analysis of call-by-value computation ⋮ A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus ⋮ Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus ⋮ Algorithmic probabilistic game semantics. Playing games with automata ⋮ Second-order type isomorphisms through game semantics ⋮ A game semantics of names and pointers ⋮ A Game Semantics of Idealized CSP ⋮ Towards Nominal Abramsky ⋮ Unnamed Item ⋮ Probabilistic coherence spaces as a model of higher-order probabilistic computation ⋮ Game semantics and linear CPS interpretation ⋮ Asynchronous games. II: The true concurrency of innocence ⋮ A relational account of call-by-value sequentiality ⋮ Full Abstraction for Reduced ML ⋮ Unnamed Item ⋮ A game-semantic model of computation ⋮ The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in \Bbb N$ ⋮ Parallel and serial hypercoherences ⋮ Syntax vs. semantics: A polarized approach ⋮ Sequential algorithms and strongly stable functions ⋮ The sequentially realizable functionals ⋮ Games and full abstraction for FPC. ⋮ Full abstraction for PCF ⋮ Definability and Full Abstraction
This page was built for publication:
