The SCEAS System
Navigation Menu

Conferences in DBLP

Logic in Computer Science (LICS) (lics)
1993 (conf/lics/LICS8)

  1. Andrew M. Pitts
    Bisimulation and Co-induction (Tutorial) [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:2-3 [Conf]
  2. Giuseppe Longo, Kathleen Milsted, Sergei Soloviev
    The Genericity Theorem and the Notion of Parametricity in the Polymorphic lambda-calculus (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:6-14 [Conf]
  3. My Hoang, John C. Mitchell, Ramesh Viswanathan
    Standard ML-NJ weak polymorphism and imperative constructs [Citation Graph (1, 0)][DBLP]
    LICS, 1993, pp:15-25 [Conf]
  4. John C. Mitchell, Furio Honsell, Kathleen Fisher
    A lambda calculus of objects and method specialization [Citation Graph (1, 0)][DBLP]
    LICS, 1993, pp:26-38 [Conf]
  5. Michel Parigot
    Strong Normalization for Second Order Classical Natural Deduction [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:39-46 [Conf]
  6. Shang-Ching Chou, Xiao-Shan Gao, Jing-Zhong Zhang
    Automated Production of Traditional Proofs for Constructive Geometry Theorems [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:48-56 [Conf]
  7. Paliath Narendran, Frank Pfenning, Richard Statman
    On the Unification Problem for Cartesian Closed Categories [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:57-63 [Conf]
  8. Tobias Nipkow
    Functional Unification of Higher-Order Patterns [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:64-74 [Conf]
  9. Leo Bachmair, Harald Ganzinger, Uwe Waldmann
    Set Constraints are the Monadic Class [Citation Graph (1, 0)][DBLP]
    LICS, 1993, pp:75-83 [Conf]
  10. Andrew M. Pitts
    Relational Properties of Recursively Defined Domains [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:86-97 [Conf]
  11. Stephen D. Brookes
    Full Abstraction for a Shared Variable Parallel Language [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:98-109 [Conf]
  12. Marcelo P. Fiore
    A Coinduction Principle for Recursive Data Types Based on Bisimulation [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:110-119 [Conf]
  13. Phokion G. Kolaitis
    A Tutorial on Finite Model Theory (Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:122- [Conf]
  14. Amir Pnueli, Lenore D. Zuck
    In and Out of Temporal Logic [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:124-135 [Conf]
  15. Igor Walukiewicz
    On Completeness of the mu-calculus [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:136-146 [Conf]
  16. Ahmed Bouajjani, Rachid Echahed, Joseph Sifakis
    On Model Checking for Real-Time Properties with Durations [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:147-159 [Conf]
  17. Parosh Aziz Abdulla, Bengt Jonsson
    Verifying Programs with Unreliable Channels [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:160-170 [Conf]
  18. Damian Niwinski, Alexei P. Stolboushkin
    y = 2x vs. y = 3x [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:172-178 [Conf]
  19. Bruno Courcelle
    Monadic Second-Order Logic and Hypergraph Orientation [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:179-190 [Conf]
  20. James F. Lynch
    Infinitary Logics and Very Sparse Random Graphs [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:191-198 [Conf]
  21. Guy Fayolle, Stéphane Grumbach, Christophe Tollu
    Asymptotic Probabilities of Languages with Generalized Quantifiers [Citation Graph (1, 0)][DBLP]
    LICS, 1993, pp:199-207 [Conf]
  22. Moreno Falaschi, Maurizio Gabbrielli, Kim Marriott, Catuscia Palamidessi
    Compositional Analysis for Concurrent Constraint Programming [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:210-221 [Conf]
  23. Peter Schroeder-Heister
    Rules of Definitional Reflection [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:222-232 [Conf]
  24. Amy P. Felty
    Encoding the Calculus of Constructions in a Higher-Order Logic [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:233-244 [Conf]
  25. Joachim Lambek
    Programs, grammars and arguments: a personal view of some connections between computation, language and logic [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:246-249 [Conf]
  26. Jon Barwise, Jerry Seligman
    Imperfect information flow [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:252-260 [Conf]
  27. Val Tannen, Delia Kesner, Laurence Puel
    A Typed Pattern Calculus [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:262-274 [Conf]
  28. C.-H. Luke Ong
    Non-Determinism in a Functional Setting [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:275-286 [Conf]
  29. Wesley Phoa
    Adequacy for untyped translations of typed lambda-calculi [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:287-295 [Conf]
  30. Vincent Danos, Laurent Regnier
    Local and asynchronous beta-reduction (an analysis of Girard's execution formula) [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:296-306 [Conf]
  31. Paul Beame, Toniann Pitassi
    An Exponential Separation between the Matching Principle and the Pigeonhole Principle [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:308-319 [Conf]
  32. Anil Seth
    Some Desirable Conditions for Feasible Functionals of Type~2 [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:320-331 [Conf]
  33. Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson
    Database Query Languages Embedded in the Typed Lambda Calculus [Citation Graph (6, 0)][DBLP]
    LICS, 1993, pp:332-343 [Conf]
  34. Laks V. S. Lakshmanan, Karima Ashraf, Jiawei Han
    Homomorphic Tree Embeddings and Their Applications to Recursive Program Optimization [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:344-353 [Conf]
  35. Ursula Martin, Elizabeth Scott
    The order types of termination orderings on monadic terms, strings and multisets [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:356-363 [Conf]
  36. Paliath Narendran, Michaël Rusinowitch
    The Unifiability Problem in Ground AC Theories [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:364-370 [Conf]
  37. Gordon D. Plotkin
    Type Theory and Recursion (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:374- [Conf]
  38. Benjamin C. Pierce, Davide Sangiorgi
    Typing and Subtyping for Mobile Processes [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:376-385 [Conf]
  39. Søren Christensen, Yoram Hirshfeld, Faron Moller
    Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:386-396 [Conf]
  40. Matthew Hennessy
    A Fully Abstract Denotational Model for Higher-Order Processes (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:397-408 [Conf]
  41. Lalita Jategaonkar, Albert R. Meyer
    Self-Synchronization of Concurrent Processes (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:409-417 [Conf]
  42. André Joyal, Mogens Nielsen, Glynn Winskel
    Bisimulation and open maps [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:418-427 [Conf]
  43. Mati Pentus
    Lambek Grammars Are Context Free [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:429-433 [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