TYPES list archives

Last update: Wed Feb 05 18:55:17 97
118 messages

Semantics Lectures at IBM Yorktown meyer@theory.LCS.MIT.EDU
Kripke lambda models John Mitchell <jcm@ra.stanford.edu>
well-founded induction lcp%computer-lab.cambridge.ac.uk@nss.cs.ucl.ac.uk
CCCs of Stable Domains Paul Taylor <pt%doc.imperial.ac.uk@nss.cs.ucl.ac.uk>
Feasible Mathematics Workshop "Philip J. Scott" <SCPSG%UOTTAWA.BITNET@mitvma.mit.edu>
archives of messages meyer@theory.LCS.MIT.EDU
archives of messages meyer@theory.LCS.MIT.EDU
archives of messages ray@theory.LCS.MIT.EDU (Ray Hirschfeld)
CRCT Colloquium, 2/9, Semantic Interpretation menke@harvard.harvard.edu (Baiba Menke)
set-models of polymorphism mcvax!margaux.inria.fr!coquand@uunet.uu.net (Thierry Coquand)
PENN LOGIC MEETING Andre Scedrov <Andre@cis.upenn.edu>
Research Associate In Generic Theorem Proving lcp%computer-lab.cambridge.ac.uk@nss.cs.ucl.ac.uk
confluence for typed terms John Mitchell <jcm@ra.stanford.edu>
Confluence for typed terms oravax!garrel@wrath.cs.cornell.edu (Garrel Pottinger)
Confluence for typed terms oravax!garrel@wrath.cs.cornell.edu (Garrel Pottinger)
Confluence for typed terms oravax!garrel@wrath.cs.cornell.edu (Garrel Pottinger)
confluence for typed terms Robert Harper <Robert.Harper@proof.ergo.cs.cmu.edu>
Confluence and SN property jean@central.cis.upenn.edu
typed versus untyped CR proofs jr.hindley <majrh%PYR.SWAN.AC.UK@mitvma.mit.edu>
LOGIC MEETING UPDATE Andre Scedrov <Andre@cis.upenn.edu>
BU colloq/ March 3 pam@bu-cs.bu.edu
LICS-89 meyer@theory.LCS.MIT.EDU
Question concerning ideals Pavel.pa@xerox.com
A proposed contribution in the types forum curien@src.dec.com (Pierre-Louis Curien)
(long) Comments on Wadler's parametric polymorphism meyer@theory.LCS.MIT.EDU
Subtyping for Recursive Types James William O'Toole Jr. <james@zermatt.lcs.mit.edu>
Subtyping for Recursive Types meyer@theory.LCS.MIT.EDU
Variants, subtyping Andre Scedrov <Andre@cis.upenn.edu>
subtyping and recursion (james@zermatt) John Mitchell <jcm@ra.stanford.edu>
Implicit Recursion Andrew Pitts <ap%computer-lab.cambridge.ac.uk@nss.cs.ucl.ac.uk>
Implicit Recursion Andrew Pitts <ap%computer-lab.cambridge.ac.uk@nss.cs.ucl.ac.uk>
slippery substitutions jean@central.cis.upenn.edu
Query: implicit recursion nax@gvax.cs.cornell.edu (Nax)
Re: Query: implicit recursion gray@symcom.math.uiuc.edu (John Gray)
Types & Strictness (forwarded) Andrew Pitts <ap%computer-lab.cambridge.ac.uk@nss.cs.ucl.ac.uk>
Eta Rules Andrew Pitts <ap%computer-lab.cambridge.ac.uk@nss.cs.ucl.ac.uk>
Re. Gavin Wraith's message on Types & Strictness nikhil@juicy-juice.lcs.mit.edu (Rishiyur S. Nikhil)
Cobig, Coproduct, and Comma (410 lines) Vaughan Pratt <coraki!pratt@sun.com>
Re: Cobig, Coproduct, and Comma gray@symcom.math.uiuc.edu (John Gray)
Cobig Comma Pratt Gavin Wraith <gavinw%cogs.sussex.ac.uk@nss.cs.ucl.ac.uk>
AMAST Conference program and registration Teodor Rus <rus@herky.cs.uiowa.edu>
Wraith on recursive sums and products coraki!pratt@sun.com
MIT seminar: Ait-Kaci, April 6 meyer@theory.LCS.MIT.EDU
Argument for less recursion in datatype definitions Vaughan Pratt <coraki!pratt@sun.com>
formal arguments to lambdas in Scheme meyer@theory.LCS.MIT.EDU
Further to V.Pratt's reply Gavin Wraith <gavinw%cogs.sussex.ac.uk@nss.cs.ucl.ac.uk>
Less recursion in type defs unido!unipas!sokolow@uunet.uu.net (Stefan Sokolowski)
RE: Plotkin-Statman conjecture GDP%ECSVAX.ED.AC.UK@MITVMA.MIT.EDU (Gordon Plotkin)
implicit recursion Ryu Hasegawa <ryu%kurims.kurims.kyoto-u.junet%relay.cc.u-tokyo.ac.jp@relay.cs.net>
Numeral Systems David Wolfram <daw%computer-lab.cambridge.ac.uk@nss.cs.ucl.ac.uk>
MFPS special session gunter@central.cis.upenn.edu (Carl Gunter)
MFPS special session gunter@central.cis.upenn.edu (Carl Gunter)
[pam@bu-cs.bu.edu: BU 4/26 colloq] meyer@theory.LCS.MIT.EDU
Proofs and Types (Girard et al) Paul Taylor <pt%doc.imperial.ac.uk@nsfnet-relay.ac.uk>
LICS registration meyer@theory.LCS.MIT.EDU
Peter Buneman seminar Friday May 12, MIT nikhil@juicy-juice.lcs.mit.edu
TOC Seminar -- Philippe Le Chenedec -- Thur., May 25 craig@theory.LCS.MIT.EDU
Computers & Math Richard Jenks <JENKS@ibm.com>
Summer school Philip Wadler <wadler%cs.glasgow.ac.uk@nsfnet-relay.ac.uk>
Summer school: errata Philip Wadler <wadler%cs.glasgow.ac.uk@nsfnet-relay.ac.uk>
TOC Seminar -- Kurt Sieber -- Tue., June 27 craig@theory.LCS.MIT.EDU
Stability and Sequentiality Paul Taylor <pt%doc.imperial.ac.uk@nsfnet-relay.ac.uk>
Stability and Sequentiality meyer@theory.LCS.MIT.EDU
A sequential CCC? Andreas Knobel <ak%lfcs.edinburgh.ac.uk@nsfnet-relay.ac.uk>
Feasible Math Workshop "Philip J. Scott" <SCPSG%UOTTAWA.BITNET@mitvma.mit.edu>
Semantics using ML John C. Mitchell <jcm@polya.stanford.edu>
Semantics using ML gunter@central.cis.upenn.edu (Carl Gunter)
Semantics using ML Paul Hudak <hudak-paul@yale.edu>
Semantics using ML Mitchell Wand <wand@corwin.ccs.northeastern.edu>
combinatory license plates John C. Mitchell <jcm@polya.stanford.edu>
combinatory license plates John C. Mitchell <jcm@polya.stanford.edu>
technical report available Jon Fairbairn <jf%computer-lab.cambridge.ac.uk@nsfnet-relay.ac.uk>
Post doc position for work on SML compiler meyer@theory.LCS.MIT.EDU
semi-unification Gert Smolka <SMOLKA%DS0LILOG.BITNET@mitvma.mit.edu>
Bounded Linear Logic "A. Scedrov & P.J.Scott " <SCPSG%UOTTAWA.BITNET@mitvma.mit.edu>
Bounded Linear Logic (Revised Announcement) Phil Scott <SCPSG%UOTTAWA.BITNET@mitvma.mit.edu>
Coherence of Subsumption curien@src.dec.com (Pierre-Louis Curien)
re: Bounded Linear Logic Paul Taylor <pt%doc.imperial.ac.uk@nsfnet-relay.ac.uk>
meyer to plotkin re full-abstraction for call-by-value meyer@theory.LCS.MIT.EDU
Interdefinability of Parallel Operations in PCF Allen Stoughton <allen%cogs.sussex.ac.uk@nsfnet-relay.ac.uk>
Interdefinability of Parallel Operations in PCF Allen Stoughton <allen%cogs.sussex.ac.uk@nsfnet-relay.ac.uk>
Sieber's Full-Abstraction for call-by-value (241 lines) Matthias Felleisen <matthias@rice.edu>
call-by-value semantics, etc. (248 lines) gunter@central.cis.upenn.edu (Carl Gunter)
Conservative extension by surjective pairing meyer@theory.LCS.MIT.EDU
LICS '90: Call for Papers LICS@B.GP.CS.CMU.EDU
LICS '90: Call for Papers LICS@b.gp.cs.cmu.edu
Third Logical Biennial Conference, Bulgaria, June '90 meyer@theory.LCS.MIT.EDU
Completeness Theorem for Typed Lambda-Omega Calculus meyer@theory.LCS.MIT.EDU
lazy lambda calculus references meyer@theory.LCS.MIT.EDU
[wand@corwin.ccs.northeastern.edu: [riecke@theory.LCS.MIT.EDU: This week's meeting]] meyer@theory.LCS.MIT.EDU
Call for Participation: "Types in Logic Programming" Workshop meyer@theory.LCS.MIT.EDU
JCIT N27%TAUNOS.BITNET@mitvma.mit.edu
ML Type-Checking is DEXP-complete tiuryn@cs.bu.edu
semi-unification is undecidable tiuryn@cs.bu.edu
Journal of Functional Programming Paul Hudak <hudak-paul@yale.edu>
Abstract for "Logic from Computer Science" John C. Mitchell <jcm@polya.stanford.edu>
Program: NACLP'89 Workshop on Types in Logic Programming Frank Pfenning <Frank.Pfenning@proof.ergo.cs.cmu.edu>
Call for Papers: 1990 ACM Conf. on Lisp & Functional Programming mitchell wand <wand@flora.ccs.northeastern.edu>
Welcome to SML Benjamin.Pierce@proof.ergo.cs.cmu.edu
MIT TOC Seminar--Jerzy Tiuryn--Tue. Oct. 10, 1989 dmjones@theory.LCS.MIT.EDU
Earthquake John C. Mitchell <jcm@polya.stanford.edu>
Semi-Unification and Type Inference Dr. Hans Leiss <leiss%inf21@ztivax.siemens.com>
Undecidable Second-order Type-Scheme Problem coppo%ITOINFO.BITNET@cunyvm.cuny.edu
MIT TOC Seminar--Harry Mairson--Wed Nov 1 dmjones@theory.LCS.MIT.EDU (David M. Jones)
Descriptions, Excluded Middle, and Constructions oravax!eurylochus.UUCP!garrel@wrath.cs.cornell.edu
The Classification of Continuous Domains Achim Jung <aj%doc.imperial.ac.uk@nsfnet-relay.ac.uk>
type inference - terminology "Uday S. Reddy" <reddy@cs.uiuc.edu>
type inference - terminology meyer@theory.LCS.MIT.EDU (Albert R. Meyer)
type inference - terminology meyer@theory.LCS.MIT.EDU (Albert R. Meyer)
Call-by-value (eager) vs. Call-by-name (lazy) John C. Mitchell <jcm@cs.stanford.edu>
Call-by-value (eager) vs. Call-by-name (lazy) Vaughan Pratt <pratt@cs.stanford.edu>
non-strict conditional John C. Mitchell <jcm@cs.stanford.edu>
Re: Call-by-value (eager) vs. Call-by-name (lazy) Re: Call-by-value (eager) vs. Call-by-name (lazy) ap%computer-lab.cambridge.ac.uk@nsfnet-relay.ac.uk
Call-by-value (eager) vs. Call-by-name (lazy) lcp%computer-lab.cambridge.ac.uk@nsfnet-relay.ac.uk
Re: Call-by-value (eager) vs. Call-by-name (lazy) Paul Taylor <pt@doc.imperial.ac.uk>
Call-by-value (eager) vs. Call-by-name (lazy) kim@cs.williams.edu
conditionals Robert Harper <Robert.Harper@proof.ergo.cs.cmu.edu>
"Proofs & Types" (Girard et al) Paul Taylor <pt@doc.imperial.ac.uk>