Discrimination by parallel observers: the algorithm.

DOI10.1006/INCO.1998.2773MaRDI QIDQ1854269zbMATH OpenOpenAlexWikidataFDO

Authors Jerzy Tiuryn, Mariangiola Dezani-Ciancaglini, Paweł Urzyczyn

Publication date 14 January 2003

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/a37a1a9f1fd926ae3bb6413c125e0b0c4143b7cc

zbMATH Keywords

bisimulation

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• The lazy lambda calculus in a concurrency scenario
• Discriminating lambda-terms using clocked Böhm trees
• The discriminating power of multiplicities in the \(\lambda\)-calculus
• Lambda-calculi for (strict) parallel functions
• Infinitary lambda calculus and discrimination of Berarducci trees.

Cites work

• scientific article; zbMATH DE number 3780545 (Why is no real title available?)
• scientific article; zbMATH DE number 1267558 (Why is no real title available?)
• A Filter Model for Concurrent $\lambda$-Calculus
• A calculus of mobile processes. II
• A characterization of F-complete type assignments
• A filter lambda model and the completeness of type assignment
• A filter model for mobile processes
• A fully abstract denotational model for higher-order processes
• An algebraic interpretation of the K-calculus; and an application of a labelled -calculus
• Domain theory in logical form
• Filter models for conjunctive-disjunctive \(\lambda\)-calculi
• Full abstraction in the lazy lambda calculus
• Intersection and union types: Syntax and semantics
• Lambda-calculi for (strict) parallel functions
• Lazy lambda calculus: theories, models and local structure characterization (extended abstract)
• Modal logics for mobile processes
• Set-theoretical and other elementary models of the \(\lambda\)-calculus
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• Structured operational semantics and bisimulation as a congruence
• Testing equivalence for mobile processes
• The discriminating power of multiplicities in the \(\lambda\)-calculus
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The lazy lambda calculus in a concurrency scenario
• Type theories, normal forms, and \(D_{\infty}\)-lambda-models

Cited in

(7)

• From Böhm's theorem to observational equivalences: an informal account
• Intersection types for \(\lambda\)-trees
• Safety of Nöcker's strictness analysis
• Infinitary lambda calculus and discrimination of Berarducci trees.
• The lazy lambda calculus in a concurrency scenario
• Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca
• Discriminating lambda-terms using clocked Böhm trees

This page was built for publication: Discrimination by parallel observers: the algorithm.

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