The SCEAS System
Navigation Menu

Conferences in DBLP

Theoretical Aspects of Computer Software (TACS) (tacs)
1991 (conf/tacs/1991)

  1. Gordon D. Plotkin
    A Semantics for Type Checking. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:1-17 [Conf]
  2. Paola Giannini, Simona Ronchi Della Rocca
    Type Inference in Polymorphic Type Discipline. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:18-37 [Conf]
  3. Makoto Tatsuta
    Monotone Recursive Definition of Predicates and Its Realizability Interpretation. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:38-52 [Conf]
  4. Masahiko Sato
    Adding Proof Objects and Inductive Definition Mechanisms to Frege Structures. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:53-87 [Conf]
  5. Wesley Phoa
    From Term Models to Domains. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:88-111 [Conf]
  6. Carl A. Gunter, Elsa L. Gunter, David B. MacQueen
    An Abstract Interpretation for ML Equality Kinds. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:112-130 [Conf]
  7. Trevor Jim, Albert R. Meyer
    Full Abstraction and the Context Lemma. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:131-151 [Conf]
  8. S. Arun-Kumar, Matthew Hennessy
    An Efficiency Preorder for Processes. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:152-175 [Conf]
  9. Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
    On Nets, Algebras and Modularity. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:176-203 [Conf]
  10. Bengt Jonsson, Joost N. Kok
    Towards a Complete Hierarchy of Compositional Dataflow Models. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:204-225 [Conf]
  11. Robert L. Constable
    Type Theory as a Foundation for Computer Science. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:226-243 [Conf]
  12. Amir Pnueli, M. Shalev
    What is in a Step: On the Semantics of Statecharts. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:244-264 [Conf]
  13. Krzysztof R. Apt, Dino Pedreschi
    Proving Termination of General Prolog Programs. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:265-289 [Conf]
  14. John C. Mitchell
    On Abstraction and the Expressive Power of Programming Languages. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:290-310 [Conf]
  15. Kazuhiro Fuchi, Koichi Furukawa
    Role of Logic Programming in the FGCS Project. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:311-325 [Conf]
  16. Martín Abadi, Michael Burrows, C. Kaufman, Butler W. Lampson
    Authentication and Delegation with Smart-cards. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:326-345 [Conf]
  17. Bernhard Steffen
    Data Flow Analysis as Model Checking. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:346-365 [Conf]
  18. Phil Pfeiffer, Rebecca Parsons Selke
    On the Adequacy of Dependence-Based Representations for Programs with Heaps. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:365-386 [Conf]
  19. Masami Hagiya
    From Programming-by-Example to Proving-by-Example. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:387-419 [Conf]
  20. Jean-Louis Lassez
    From LP to LP: Programming with Constraints. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:420-446 [Conf]
  21. Dieter Armbruster
    Polynomial Recursion Analysis in Pascal Like Programs. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:447-458 [Conf]
  22. Hardi Hungar
    Complexity of Proving Program Correctness. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:459-474 [Conf]
  23. David A. Basin, Douglas J. Howe
    Some Normalization Properties of Martin-Löf's Type Theory, and Applications. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:475-494 [Conf]
  24. Ryu Hasegawa
    Parametricity of Extensionally Collapsed Term Models of Polymorphism and Their Categorical Properties. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:495-512 [Conf]
  25. Shin-ya Nishizaki
    Programs with Continuations and Linear Logic. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:513-531 [Conf]
  26. David Walker
    Pi-Calculus Semantics of Object-Oriented Programming Languages. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:532-547 [Conf]
  27. Andreas V. Hense
    Wrapper Semantics of an Object-Oriented Programming Language with State. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:548-568 [Conf]
  28. Mark Ryan, José Luiz Fiadeiro, T. S. E. Maibaum
    Sharing Actions and Attributes in Modal Action Logic. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:569-593 [Conf]
  29. Ralf Treinen
    First Order Data Types and First Order Logic. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:594-614 [Conf]
  30. Max I. Kanovich
    Efficient Program Synthesis: Semantics, Logic, Complexity. [Citation Graph (1, 0)][DBLP]
    TACS, 1991, pp:615-632 [Conf]
  31. Sachio Hirokawa
    Principal Type-Schemes of BCI-Lambda-Terms. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:633-650 [Conf]
  32. Franco Barbanera, Mariangiola Dezani-Ciancaglini
    Intersection and Union Types. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:651-674 [Conf]
  33. John C. Reynolds
    The Coherence of Languages with Intersection Types. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:675-700 [Conf]
  34. Susumu Hayashi
    Singleton, Union and Intersection Types for Program Extraction. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:701-730 [Conf]
  35. Pierre-Louis Curien, Giorgio Ghelli
    Subtyping + Extensionality: Confluence of beta-eta-top reduction in F<=. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:731-749 [Conf]
  36. Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov
    An Extension of System F with Subtyping. [Citation Graph (3, 0)][DBLP]
    TACS, 1991, pp:750-770 [Conf]
  37. Dana S. Scott
    Will Logicians be Replaced by Machines? [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:771- [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002