The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Robin Milner
    Strong Normalisation in Higher-Order Action Calculi. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:1-19 [Conf]
  2. Jacques Garrigue, Didier Rémy
    Extending ML with Semi-Explicit Higher-Order Polymorphism. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:20-46 [Conf]
  3. Alexander Aiken, Edward L. Wimmers, Jens Palsberg
    Optimal Representations of Polymorphic Types with Subtyping (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:47-76 [Conf]
  4. Zena M. Ariola, Stefan Blom
    Cyclic Lambda Calculi. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:77-106 [Conf]
  5. Atsushi Ohori
    Type System for Specializing Polymorphism. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:107-137 [Conf]
  6. Mario Coppo, Ferruccio Damiani, Paola Giannini
    On Strictness and Totality. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:138-164 [Conf]
  7. Julia L. Lawall, Peter Thiemann
    Sound Specialization in the Presence of Computational Effects. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:165-190 [Conf]
  8. Yoshiki Kinoshita, Peter W. O'Hearn, John Power, Makoto Takeyama, Robert D. Tennent
    An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:191-212 [Conf]
  9. Marcello M. Bonsangue, Joost N. Kok
    Infinitary Domain Logic for Finitary Transition Systems. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:213-232 [Conf]
  10. Jean-Jacques Lévy
    Some Results in the Joint-Calculus. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:233-249 [Conf]
  11. Julian Rathke, Matthew Hennessy
    Local Model Checking for Value-Passing Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:250-266 [Conf]
  12. Kaisa Sere, Marina A. Waldén
    Data Refinement and Remote Procedures. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:267-294 [Conf]
  13. Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan
    A Type-Theoretic Approach to Deadlock-Freedom of Asynchronous Systems. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:295-320 [Conf]
  14. Carolyn L. Talcott
    Composable Semantic Models for Actor Theories. [Citation Graph (1, 0)][DBLP]
    TACS, 1997, pp:321-364 [Conf]
  15. Franco Barbanera, Stefano Berardi, Massimo Schivalocchi
    "Classical" Programming-with-Proofs in lambdaPASym: An Analysis of Non-confluence. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:365-390 [Conf]
  16. John Power, Hayo Thielecke
    Environments, Continuation Semantics and Indexed Categories. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:391-414 [Conf]
  17. Kim B. Bruce, Luca Cardelli, Benjamin C. Pierce
    Comparing Object Encodings. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:415-438 [Conf]
  18. Erik Poll
    System F with Width-Subtyping and Record Updating. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:439-457 [Conf]
  19. Lars Birkedal, Robert Harper
    Relational Interpretations of Recursive Types in an operational Setting (Summary). [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:458-490 [Conf]
  20. Seán Matthews
    Extending a Logical Framework with a Modal Connective for Validity. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:491-514 [Conf]
  21. Samuel Boutin
    Using Reflection to Build Efficient and Certified Decision Procedures. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:515-529 [Conf]
  22. Benjamin Werner
    Sets in Types, Types in Sets. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:530-346 [Conf]
  23. Richard Mayr
    Combining Petri Nets and PA-Processes. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:547-561 [Conf]
  24. Satoshi Yamane, Kazuhiro Nakamura
    Symbolic Model-Checking Method Based on Approximations and Binary Decision Diagrams for Real-Time Systems. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:562-582 [Conf]
  25. Philippa Gardner, Masahito Hasegawa
    Types and Models for Higher-Order Action Calculi. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:583-603 [Conf]
  26. Gérard P. Huet, Henri Laulhère
    Finite-State Transducers as Regular Böhm Trees. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:604-610 [Conf]
  27. Martín Abadi
    Secrecy by Typing inSecurity Protocols. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:611-638 [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