TYPES list archives

• The theorem-prover Isabelle Larry Paulson <lcp%lfcs.edinburgh.ac.uk@nsfnet-relay.ac.uk>
  
• Term Rewriting Workshop June 11-14, 1990 ctrs90@doyle.cs.concordia.ca
  
• LICS '90 Preliminary Program John C. Mitchell <jcm@cs.stanford.edu>
  
• Note on graph vs. term reduction John C. Mitchell <jcm@cs.stanford.edu>
  
• Note on graph vs. term reduction John C. Mitchell <jcm@cs.stanford.edu>
  
• Re: note on graph vs. term reduction "Gyorgy Revesz" <REVESZ@ibm.com>
  
• Re: Note on graph vs. term reduction Richard Kennaway <jrk@information-systems.east-anglia.ac.uk>
  
• Complexity questions on linear logic John C. Mitchell <jcm@cs.stanford.edu>
  
• Complexity questions on linear logic gunter@central.cis.upenn.edu
  
• Complexity questions on linear logic gunter@central.cis.upenn.edu
  
• Re: Note on graph vs. term reduction watro@linus.mitre.org
  
• re: Complexity questions on linear logic Vladimir Lifschitz <VAL@sail.stanford.edu>
  
• icdt pck@cs.brown.edu
  
• Yet another talk on OO prog meyer@theory.lcs.mit.edu (Albert R. Meyer)
  
• Category Theory Bulletin Board "RROSEBRUGH" <RROSEBRUGH%MTA.BITNET@mitvma.mit.edu>
  
• Decision problems for propositional linear logic John C. Mitchell <jcm@cs.stanford.edu>
  
• Decision problems for propositional linear logic: addendum Natarajan Shankar <shankar@csl.sri.com>
  
• Workshop: Structuring Disciplines for Logic Programming Dale Miller <dale@linc.cis.upenn.edu>
  
• Workshop on Linear Logic, Petri Nets, etc. George Cleland <glc%lfcs.edinburgh.ac.uk@nsfnet-relay.ac.uk>
  
• Short Course at UBC: Cambridge HOL System Jeffrey Joyce <joyce@cs.ubc.ca>
  
• LICS '90 LICS@b.gp.cs.cmu.edu
  
• query on petri nets & OOP well!aiyer@apple.com (Scott Aiyer)
  
• LICS 1990 attendance survey meyer@theory.lcs.mit.edu (Albert R. Meyer)
  
• CTRS '90 announcement okada@prl.dec.com
  
• CTRS '90 (Program) ctrs90@concour.cs.concordia.ca
  
• LICS '90, EARLY REGISTRATION DEADLINE jean@central.cis.upenn.edu
  
• Conference on CATEGORY THEORY AND COMPUTER SCIENCE curien%FRULM63.BITNET@mitvma.mit.edu (Pierre-Louis Curien)
  
• On confluence of simply typed Beta curien%FRULM63.BITNET@mitvma.mit.edu (Pierre-Louis Curien)
  
• Isabelle available by FTP Larry Paulson <lcp%lfcs.edinburgh.ac.uk@nsfnet-relay.ac.uk>
  
• CTRS '90, reservation date change ctrs90@concour.cs.concordia.ca
  
• ``Clausal Theory of Types'' from Cambridge Univ. Press David.Wolfram%prg.oxford.ac.uk@nsfnet-relay.ac.uk
  
• what are dependent types?? Larry Paulson <lcp%lfcs.edinburgh.ac.uk@nsfnet-relay.ac.uk>
  
• Lower bound on System F typability Fritz Henglein <henglein@praxis.cs.ruu.nl>
  
• Re: what are dependent types?? ap%computer-lab.cambridge.ac.uk@nsfnet-relay.ac.uk
  
• LICS: please respond LICS@b.gp.cs.cmu.edu
  
• Continuations Forum Jon Riecke <riecke@theory.lcs.mit.edu>
  
• Re: what are dependent types? (reply to A. Pitts) Tom Thomson <tom@nw.stl.stc.co.uk>
  
• Continuations Forum riecke@theory.lcs.mit.edu (Jon Riecke)
  
• LICS '91 Call for Papers meyer@theory.lcs.mit.edu (Albert R. Meyer)
  
• ALGEBRAIC AND LOGIC PROGRAMMING lescanne@loria.crin.fr (Pierre Lescanne)
  
• Commutative Diagrams in La/TeX Paul Taylor <pt@doc.imperial.ac.uk>
  
• Greatest fixpoints have existential types Philip Wadler <wadler@cs.glasgow.ac.uk>
  
• Response to Wadler: Greatest fixpoints have existential types ryu@kurims.kurims.kyoto-u.ac.jp (Ryu Hasegawa)
  
• Call for papers: MFPS91 Stephen.Brookes@proof.ergo.cs.cmu.edu
  
• Proceedings on Logical Frameworks: available online Gerard Huet <huet@margaux.inria.fr>
  
• Proceedings on Logical Frameworks: available online dmjones@theory.lcs.mit.edu (David M. Jones)
  
• commutative diagrams formatting package Paul Taylor <pt@doc.imperial.ac.uk>
  
• Re: commutative diagrams formatting package pratt@cs.stanford.edu
  
• Re: commutative diagrams formatting package ap@uk.ac.cam.cl
  
• commutative diagrams formatting package gunter@saul.cis.upenn.edu
  
• ISABELLE USERS EMAIL FORUM lcp@computer-lab.cambridge.ac.uk
  
• SIGACT news John C. Mitchell <jcm@cs.stanford.edu>
  
• PER's and operational semantics gunter@saul.cis.upenn.edu
  
• Lecture by Harry Mairson: Complexity of Type Inference theory-seminars-request@theory.lcs.mit.edu
  
• Re: PER's and operational semantics John C. Mitchell <jcm@cs.stanford.edu>
  
• PER's and operational semantics gunter@saul.cis.upenn.edu
  
• Extensions to Theory of Constructions (734 lines) "Jonathan P. Seldin" <seldin@antares.concordia.ca>
  
• Fixed Points in Synthetic Domain Theory Paul Taylor <pt@doc.imperial.ac.uk>
  
• Excluded middle w/o definite descriptions in theory of constructions stefano%ITOINFO.BITNET@cunyvm.cuny.edu
  
• Action logic paper Vaughan Pratt <pratt@cs.stanford.edu>
  
• Op. Sem. query rance@adm.csc.ncsu.edu (Rance Cleaveland)
  
• MFCS'91 Don Sannella <dts@lfcs.edinburgh.ac.uk>
  
• Computational interpretations of Linear Logic Samson Abramsky <sa@doc.imperial.ac.uk>
  
• LaTeX version of article "Jonathan P. Seldin" <seldin@antares.concordia.ca>
  
• Notice of meeting "R.A.G. Seely" <MT79%MUSICA.MCGILL.CA@mitvma.mit.edu>
  
• A little linear logic observation about Petri Nets Paul Taylor <pt@doc.imperial.ac.uk>
  
• Summerschool on Lambda Calculus, Jul 8-12, 91 henk@cs.kun.nl (Henk Barendregt)