|
Conferences in DBLP
- Robin Milner
Strong Normalisation in Higher-Order Action Calculi. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:1-19 [Conf]
- Jacques Garrigue, Didier Rémy
Extending ML with Semi-Explicit Higher-Order Polymorphism. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:20-46 [Conf]
- 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]
- Zena M. Ariola, Stefan Blom
Cyclic Lambda Calculi. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:77-106 [Conf]
- Atsushi Ohori
Type System for Specializing Polymorphism. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:107-137 [Conf]
- Mario Coppo, Ferruccio Damiani, Paola Giannini
On Strictness and Totality. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:138-164 [Conf]
- Julia L. Lawall, Peter Thiemann
Sound Specialization in the Presence of Computational Effects. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:165-190 [Conf]
- 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]
- Marcello M. Bonsangue, Joost N. Kok
Infinitary Domain Logic for Finitary Transition Systems. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:213-232 [Conf]
- Jean-Jacques Lévy
Some Results in the Joint-Calculus. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:233-249 [Conf]
- Julian Rathke, Matthew Hennessy
Local Model Checking for Value-Passing Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:250-266 [Conf]
- Kaisa Sere, Marina A. Waldén
Data Refinement and Remote Procedures. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:267-294 [Conf]
- 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]
- Carolyn L. Talcott
Composable Semantic Models for Actor Theories. [Citation Graph (1, 0)][DBLP] TACS, 1997, pp:321-364 [Conf]
- 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]
- John Power, Hayo Thielecke
Environments, Continuation Semantics and Indexed Categories. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:391-414 [Conf]
- Kim B. Bruce, Luca Cardelli, Benjamin C. Pierce
Comparing Object Encodings. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:415-438 [Conf]
- Erik Poll
System F with Width-Subtyping and Record Updating. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:439-457 [Conf]
- 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]
- Seán Matthews
Extending a Logical Framework with a Modal Connective for Validity. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:491-514 [Conf]
- Samuel Boutin
Using Reflection to Build Efficient and Certified Decision Procedures. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:515-529 [Conf]
- Benjamin Werner
Sets in Types, Types in Sets. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:530-346 [Conf]
- Richard Mayr
Combining Petri Nets and PA-Processes. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:547-561 [Conf]
- 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]
- Philippa Gardner, Masahito Hasegawa
Types and Models for Higher-Order Action Calculi. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:583-603 [Conf]
- 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]
- Martín Abadi
Secrecy by Typing inSecurity Protocols. [Citation Graph (0, 0)][DBLP] TACS, 1997, pp:611-638 [Conf]
|