An approach to deciding the observational equivalence of Algol-like languages (Q1886322): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.apal.2003.12.006 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apal.2003.12.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2135774937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4823132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full abstraction for PCF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular-Language Semantics for a Call-by-Value Programming Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic context free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic bisimulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On full abstraction for PCF: I, II and III / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finite Memory Programs with Recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitary PCF is not decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Automaton Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametricity and local variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4415241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for real-time strict deterministic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4813228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2704328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: A type-theoretical alternative to ISWIM, CUCH, OWHY / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(A)=L(B)\)? decidability results from complete formal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of DPDA equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737211 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.APAL.2003.12.006 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:44, 16 December 2024

scientific article
Language Label Description Also known as
English
An approach to deciding the observational equivalence of Algol-like languages
scientific article

    Statements

    An approach to deciding the observational equivalence of Algol-like languages (English)
    0 references
    0 references
    18 November 2004
    0 references
    Algorithmic game semantics
    0 references
    Algol-like languages
    0 references
    Automata theory
    0 references
    Software model-checking
    0 references

    Identifiers