scientific article; zbMATH DE number 2238212
From MaRDI portal
Publication:5713333
zbMath1080.68009MaRDI QIDQ5713333
No author found.
Publication date: 14 December 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Theory of programming languages (68N15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Semantics in the theory of computing (68Q55)
Related Items (32)
Mixed Sessions ⋮ Type checking a multithreaded functional language with session types ⋮ Type-based cost analysis for lazy functional languages ⋮ Static consistency checking for Verilog wire interconnects ⋮ Realist Consequence, Epistemic Inference, Computational Correctness ⋮ A type-directed, dictionary-passing translation of method overloading and structural subtyping in Featherweight Generic Go ⋮ Lifting numeric relational domains to algebraic data types ⋮ Implementing Variable Vectors in a CCG Parser ⋮ Algorithmic type checking for a pi-calculus with name matching and session types ⋮ Unnamed Item ⋮ A relational realizability model for higher-order stateful ADTs ⋮ Selective strictness and parametricity in structural operational semantics, inequationally ⋮ On the decidability of subtyping with bounded existential types and implementation constraints ⋮ On the reification of semantic linearity ⋮ Formal SOS-Proofs for the Lambda-Calculus ⋮ Fundamentals of session types ⋮ An Introduction to the Lambda Calculus ⋮ Mechanizing proofs with logical relations – Kripke-style ⋮ Typing Safe Deallocation ⋮ Unnamed Item ⋮ A family of syntactic logical relations for the semantics of Haskell-like languages ⋮ Mixed sessions ⋮ Enhanced type inference for binding-time analysis ⋮ F-ing modules ⋮ A trace-based model for multiparty contracts ⋮ Refined typing to localize the impact of forced strictness on free theorems ⋮ A case study in programming coinductive proofs: Howe’s method ⋮ Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus ⋮ Syntactic Logical Relations for Polymorphic and Recursive Types ⋮ Free Theorems and Runtime Type Representations ⋮ Polymorphic lambda calculus with context-free session types ⋮ Program equivalence in linear contexts
Uses Software
This page was built for publication:
