Works matching IS 18605974 AND DT 2019 AND VI 15 AND IP 1


Results: 34
    1
    2
    3

    INITIAL SEMANTICS FOR REDUCTION RULES.

    Published in:
    Logical Methods in Computer Science (LMCS), 2019, v. 15, n. 1, p. 1, doi. 10.23638/LMCS-15(1:28)2019
    By:
    • AHRENS, BENEDIKT
    Publication type:
    Article
    4

    DISPLAYED CATEGORIES.

    Published in:
    Logical Methods in Computer Science (LMCS), 2019, v. 15, n. 1, p. 1, doi. 10.23638/LMCS-15(1:20)2019
    By:
    • AHRENS, BENEDIKT;
    • LUMSDAINE, PETER LEFANU
    Publication type:
    Article
    5
    6
    7

    SHORTEST PATHS IN ONE-COUNTER SYSTEMS.

    Published in:
    Logical Methods in Computer Science (LMCS), 2019, v. 15, n. 1, p. 1
    By:
    • CHISTIKOV, DMITRY;
    • CZERWIŃSKI, WOJCIECH;
    • HOFMAN, PIOTR;
    • PILIPCZUK, MICHAL;
    • WEHAR, MICHAEL
    Publication type:
    Article
    8
    9
    10
    11
    12
    13
    14

    SAHLQVIST VIA TRANSLATION.

    Published in:
    Logical Methods in Computer Science (LMCS), 2019, v. 15, n. 1, p. 1, doi. 10.23638/LMCS-15(1:15)2019
    By:
    • CONRADIE, WILLEM;
    • PALMIGIANO, ALESSANDRA;
    • ZHIGUANG ZHAO
    Publication type:
    Article
    15
    16

    BEHAVIOURAL EQUIVALENCES FOR TIMED SYSTEMS.

    Published in:
    Logical Methods in Computer Science (LMCS), 2019, v. 15, n. 1, p. 1, doi. 10.23638/LMCS-15(1:17)2019
    By:
    • BRENGOS, TOMASZ;
    • PERESSOTTI, MARCO
    Publication type:
    Article
    17
    18
    19
    20
    21
    22

    THE PRINCIPLE OF POINTFREE CONTINUITY.

    Published in:
    Logical Methods in Computer Science (LMCS), 2019, v. 15, n. 1, p. 1, doi. 10.23638/LMCS-15(1:22)2019
    By:
    • KAWAI TATSUJI;
    • SAMBIN, GIOVANNI
    Publication type:
    Article
    23
    24
    25

    PROBABILISTIC CALL BY PUSH VALUE.

    Published in:
    Logical Methods in Computer Science (LMCS), 2019, v. 15, n. 1, p. 1, doi. 10.23638/LMCS-15(1:3)2019
    By:
    • EHRHARD, THOMAS;
    • TASSON, CHRISTINE
    Publication type:
    Article
    26
    27
    28
    29

    A TOPOLOGICAL SCOTT CONVERGENCE THEOREM.

    Published in:
    Logical Methods in Computer Science (LMCS), 2019, v. 15, n. 1, p. 1, doi. 10.23638/LMCS-15(1:29)2019
    By:
    • ANDRADI, HADRIAN;
    • WENG KIN HO
    Publication type:
    Article
    30
    31
    32
    33

    A LIGHT MODALITY FOR RECURSION.

    Published in:
    Logical Methods in Computer Science (LMCS), 2019, v. 15, n. 1, p. 1, doi. 10.23638/LMCS-15(1:8)2019
    By:
    • SEVERI, PAULA
    Publication type:
    Article
    34

    SHRUB-DEPTH: CAPTURING HEIGHT OF DENSE GRAPHS.

    Published in:
    Logical Methods in Computer Science (LMCS), 2019, v. 15, n. 1, p. 1, doi. 10.23638/LMCS-15(1:7)2019
    By:
    • GANIAN, ROBERT;
    • HLINĚNÝ, PETR;
    • NEŠETŘIL, JAROSLAV;
    • OBDRŽÁLEK, JAN;
    • DE MENDEZ, PATRICE OSSONA
    Publication type:
    Article