TYPES list archives

Last update: Wed Feb 05 18:56:12 97
141 messages

Concurrency and linear logic paper Vaughan Pratt <pratt@cs.stanford.edu>
Corrections to "Concurrent Automata and their Logic" Vaughan Pratt <pratt@cs.stanford.edu>
automata or schedules !? Vaughan Pratt <pratt@cs.stanford.edu>
automata run schedules Vaughan Pratt <pratt@cs.stanford.edu>
5th Jumelage on Typed Lambda Calculus longo%FRULM63.BITNET@mitvma.mit.edu (Giuseppe Longo)
Optimal Derivation in Term Rewriting Systems, 1/29, 10:45am radle@au-bon-pain.lcs.mit.edu (Barbara Radle)
MFPS91 conference Stephen.Brookes@proof.ergo.cs.cmu.edu
MFPS91 program Stephen.Brookes@proof.ergo.cs.cmu.edu
MFPS91 local arrangements Stephen.Brookes@proof.ergo.cs.cmu.edu
Long beta/eta normal forms Colin B Jay <cbj@lfcs.edinburgh.ac.uk>
equational versions of fixed-point induction John C. Mitchell <jcm@cs.stanford.edu>
MFPS'91 Schedule Stephen.Brookes@proof.ergo.cs.cmu.edu
2nd Russian Conference on Logic Programming voronkov@math.nsk.su
CADE-11 nvm@cs.albany.edu (Neil Murray)
Lambda calculus and surjective pairing curien%FRULM63.BITNET@mitvma.mit.edu (Pierre-Louis Curien)
Research position at Edinburgh gdp@lfcs.edinburgh.ac.uk
LICS'91 Program LICS.DATABASE@b.gp.cs.cmu.edu
[mwpl@concour.cs.concordia.ca: Announcement of MWPL] mwpl@concour.cs.concordia.ca
LICS'91 Registration LICS@b.gp.cs.cmu.edu
monotonic subtype relations? clem@echo.canberra.edu.au (Clem Baker-Finch)
Re: monotonic subtype relations? John.Reynolds@proof.ergo.cs.cmu.edu
Re: monotonic subtype relations? kim@theory.stanford.edu
Categorial View of Loop Invariants C Barry Jay <cbj@lfcs.edinburgh.ac.uk>
CADE 92, Call for Papers sally@cs.albany.edu (Sally Goodall)
Trakhtenbrot Symposium Program, June 10-12, Tel-Aviv meyer@theory.lcs.mit.edu (Albert R. Meyer)
Constructivity Symposium Paul Myers <PMYERS%TRINITY.BITNET@mitvma.mit.edu>
FPCA '91 Advance Progra muller@das.harvard.edu
Category conference, Paris, 9/3-6/91 curien%FRULM63.BITNET@mitvma.mit.edu (Pierre-Louis Curien)
LFCS'92: Logic at Tver, 7/20-24/92 anil@mssun7.msi.cornell.edu
Paper on Programming Language Expressivenes John C. Mitchell <jcm@cs.stanford.edu>
CAAP-ESOP9 qian@informatik.uni-bremen.de (Zhenyu Qian)
OOL paper available by ftp kim@cs.williams.edu (Kim Bruce)
ILPS-91 Workshop, 10/31/91 Arcot Rajasekar <sekar@ms.uky.edu>
Curry typing P-complete John C. Mitchell <jcm@cs.stanford.edu>
ML with callcc is unsound Robert.Harper@gottlob.tip.cs.cmu.edu
LICS'92 Preliminary Call meyer@theory.lcs.mit.edu (Albert R. Meyer)
paper on Typed Relations extended with Subtypes for anonymous ft leavens@bambam.cs.iastate.edu. (Gary Leavens)
Abstracts from Trakhtenbrot's 70th Birthday symposium "David M. Jones" <dmjones@theory.lcs.mit.edu>
Bounded Quantification is Undecidable Benjamin_Pierce@kurt.tip.cs.cmu.edu
semantics book by Tennent rdt@qucis.queensu.ca (Robert Tennent)
Monograph: Type Theory and Functional Programming sjt@ukc.ac.uk
CTCS 91, Last announcement curien%FRULM63.BITNET@mitvma.mit.edu (Pierre-Louis Curien)
Book: Simon Thompson, "Type Theory and Functional Programming" sjt@ukc.ac.uk
Archives of Types, Logic and Concurrency lists meyer@theory.lcs.mit.edu
semantics talks at Kansas State, aug-sep, 91 danvy@cis.ksu.edu (Olivier Danvy)
Online bibliography for Information and Computation dmjones@theory.lcs.mit.edu (David M. Jones)
Online bibliography for TACS'91 dmjones@theory.lcs.mit.edu (David M. Jones)
objecttypes mailing list jpalsberg@daimi.aau.dk
representation of L-domains Guoqiang Zhang <gqz@engin.umich.edu>
talks at Kansas State (final program) danvy@cis.ksu.edu (Olivier Danvy)
ISABELLE-91 Lawrence Paulson <Larry.Paulson@cl.cam.ac.uk>
cfp -- ACM SIGPLAN Workshop on Continuations CW92 danvy@cis.ksu.edu (Olivier Danvy)
June 92 ACM SIGPLAN Workshop on Partial Evaluation Charles Consel <consel-charles@CS.YALE.EDU>
SML Workshop John C. Mitchell <jcm@cs.stanford.edu>
Typability in F_omega urzy@cs.bu.edu (Pawel Urzyczyn)
availability of semantics book rdt@qucis.queensu.ca (Robert Tennent)
2nd Montreal workshop on prog langs okada@concour.cs.concordia.ca
the price of embedding-projection pairs John C. Mitchell <jcm@cs.stanford.edu>
Monograph: "...Category Theory for the Working Computer Scientist" longo%FRULM63.BITNET@mitvma.mit.edu (Giuseppe Longo)
Function construction principle in calculus of constructions JONATHAN SELDIN <seldin@alcor.concordia.ca>
computer proves a "types" theorem mairson@crl.dec.com
Coq Version 5.6 is available! Gerard Huet <huet@margaux.inria.fr>
Robin Milner - 1991 Turing Award Winner meyer@theory.lcs.mit.edu (Albert R. Meyer)
CFP: ACM Workshop on Partial Evaluation ** New Deadline *** Charles Consel <consel-charles@CS.YALE.EDU>
Interpreter Based on Denotational Semantics "Andreas Hense" <hense@sbecsun.cs.uni-sb.de>
Why Prolog and CBV? John C. Mitchell <jcm@cs.stanford.edu>
Re: Why Prolog and CBV? Frank Pfenning <Frank_Pfenning@ALONZO.TIP.CS.CMU.EDU>
Re: Why Prolog and CBV? Frank Pfenning <Frank_Pfenning@ALONZO.TIP.CS.CMU.EDU>
Re: Why Prolog and CBV? Hans_Boehm.PARC@xerox.com
lambda calculus humor denelsbe@cs.unc.edu (Kevin Denelsbeck)
LINEAR logic forum; proofnets and kingdoms meyer@theory.lcs.mit.edu (Albert R. Meyer)
Complexity of LL Decision Problems Patrick Lincoln <lincoln@Theory.Stanford.EDU>
Some Proof Net References Patrick Lincoln <lincoln@theory.Stanford.EDU>
Kingdoms, empires, etc Gianluigi Bellin <glb@dcs.edinburgh.ac.uk>
Re: Why Prolog and CBV? Philip Wadler <wadler@dcs.glasgow.ac.uk>
selected exercises [on linear logic--ed.] andre@saul.cis.upenn.edu (Andre Scedrov)
Re: Why Prolog and CBV? "Uday S. Reddy" <reddy@cs.uiuc.edu>
Re: Why Prolog and CBV? beeson@ucscd.UCSC.EDU (20012000)
Re: Why Prolog and CBV? Robert_Harper@GOTTLOB.TIP.CS.CMU.EDU
CBV lanugage compiled to be as fast as C? Timothy_Freeman@U.ERGO.CS.CMU.EDU
Re: Why Prolog and CBV? John C. Mitchell <jcm@cs.stanford.edu>
Relations and non-commutative linear logic dgurr@daimi.aau.dk
Retraction of Claim: Completeness for Lazy Lambda Calculus riecke@saul.cis.upenn.edu (Jon Riecke)
affine logic Gianluigi Bellin <glb@dcs.edinburgh.ac.uk>
"Standard ML, Scheme, or C" beeson@ucscd.UCSC.EDU (20012000)
Why Prolog and CBV? mitchell wand <wand@cheech.lcs.mit.edu>
On quantales again H F Chau <hfc@doc.imperial.ac.uk>
Re: Why Prolog and CBV? John C. Mitchell <jcm@cs.stanford.edu>
Re: Why Prolog and CBV? Philip Wadler <wadler@dcs.glasgow.ac.uk>
Re: "Standard ML, Scheme, or C" jhr@research.att.com (John Reppy)
Why Prolog and CBV? matthias@cs.rice.edu (Matthias Felleisen)
Re: Why Prolog and CBV? Robert_Harper@GOTTLOB.TIP.CS.CMU.EDU
Re: Why Prolog and CBV? John C. Mitchell <jcm@cs.stanford.edu>
Re: Why Prolog and CBV? matthias@cs.rice.edu (Matthias Felleisen)
Re: Some Proof Net References Vijay Gehlot <vijay@dcs.glasgow.ac.uk>
semantic description of call-by-need gunter@saul.cis.upenn.edu (Carl Gunter)
Call-by-need rules S Purushothaman <purush@guardian.cs.psu.edu>
bad behavior of Call-by-value(-result) "Frank J. Oles" <oles@watson.ibm.com>
more about kingdoms; with reply by de Groote; comments by Lincoln Vincent Danos <danos@logique.jussieu.fr>
Proof Nets and Roorda's Thesis H F Chau <hfc@doc.imperial.ac.uk>
Re: Why Prolog and CBV? "Uday S. Reddy" <reddy@cs.uiuc.edu>
Generalized Horn fragments of LL maxk@cwi.nl
Sequentialized Empires and Kingdoms Gianluigi Bellin <glb@dcs.edinburgh.ac.uk>
chains vs. directed sets John C. Mitchell <jcm@cs.stanford.edu>
several replies re: chains vs. directed sets meyer@theory.lcs.mit.edu (Albert R. Meyer)
book announcement "LOGIC OF DOMAINS" gqz@zip.eecs.umich.edu
Re: Generalized Horn fragments of LL maxk@cwi.nl
Re: chains vs. directed sets val@saul.cis.upenn.edu (Val Breazu-Tannen)
Re: chains vs. directed sets Paul Taylor <pt@doc.imperial.ac.uk>
re: more about kingdoms Gianluigi Bellin <glb@dcs.edinburgh.ac.uk>
Chains and directed sets Guoqiang Zhang <gqz@engin.umich.edu>
chains, etc & announcement on intuitionistic Tarski theorem Paul Taylor <pt@doc.imperial.ac.uk>
Two sided proof nets with units rags@triples.math.mcgill.ca (Robert A. G. Seely)
Roorda's address H F Chau <hfc@doc.imperial.ac.uk>
POLARITIES, BEHAVIOURS and RELATED TOPICS Jean-Yves Girard <girard@margaux.inria.fr>
(Im)Permutabilities of LL Patrick Lincoln <lincoln@theory.Stanford.EDU>
Comment to Zhang re Chains and directed sets; reply by Zhang val@saul.cis.upenn.edu (Val Breazu-Tannen)
Re: chains, etc & announcement on intuitionistic Tarski theorem lipton@saul.cis.upenn.edu (Jim Lipton)
Other references on linear logic and proof nets Jean Gallier <jean@saul.cis.upenn.edu>
ordinals and Tarski's theorem Paul Taylor <pt@doc.imperial.ac.uk>
Some Properties of Linear Logic Proved by Semantic Methods Arnon Avron <aa%taurus.bitnet@taunivm.tau.ac.il>
POPL '92: Advance Program ravi@research.att.com
Imperial College archive & TeX fonts Paul Taylor <pt@doc.imperial.ac.uk>
on polarities and linear logic Jean-Yves Girard <girard@margaux.inria.fr>
games and classical logic Thierry Coquand <coquand@cs.chalmers.se>
proof nets for classical logic glb@dcs.edinburgh.ac.uk
Unwinding Theorem gunter@saul.cis.upenn.edu (Carl Gunter)
kingdom of several formulas regnier@logique.jussieu.fr
A. Black on Object-oriented types at Harvard menke@das.harvard.edu (Baiba Menke)
Programming with Intersection Types and Bounded Quantification Benjamin_Pierce@KURT.TIP.CS.CMU.EDU
notation anne@fwi.uva.nl (Anne S. Troelstra )
Linear logic semantics rags@triples.Math.McGill.CA (Robert A. G. Seely)
Re: Linear logic semantics aa%taurus.BITNET@mitvma.mit.edu
Semantical considerations on linear logic notation Vaughan Pratt <pratt@cs.stanford.edu>
Re: Linear logic semantics aa%taurus.BITNET@mitvma.mit.edu
Linear Notation, and good will to all rags@triples.math.mcgill.ca (Robert A. G. Seely)
Linear notation Vaughan Pratt <pratt@cs.Stanford.EDU>
Re: Linear notation Paul Taylor <pt@doc.imperial.ac.uk>
Confusion between e-mail lists meyer@theory.lcs.mit.edu (Albert R. Meyer)
Re: Linear notation aa%taurus.bitnet@taunivm.tau.ac.il
Re: Linear notation pratt@cs.Stanford.EDU