TYPES list archives

• [bemus@THEORY.LCS.MIT.EDU: TOC Seminar -- TOMORROW, January 7, 1987 -- Kurt Sieber] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• [goguen@csl.sri.com: higher order functions considered unnecessary] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• POPL Preview David K. Gifford <GIFFORD@xx.lcs.mit.edu>
  
• L-domains Paul Taylor <mcvax!doc.ic.ac.uk!pt@uunet.UU.NET>
  
• [NIKHIL@XX.LCS.MIT.EDU: Miranda available] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• [mcvax!doc.ic.ac.uk!chlo@uunet.UU.NET: Abramsky's Simulation ordering] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• [NIKHIL@XX.LCS.MIT.EDU: Your comments requested ...] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• visiting professorship John Mitchell <jcm@navajo.stanford.edu>
  
• Administrative Email to (Internet): types-request@theory.lcs.mit.edu Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• [mcvax!poincare.crin.fr!lescanne@uunet.UU.NET: a mailing on termination of rewriting systems] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• mailing lists on narrowing, termination and rewriting goguen@csl.sri.com
  
• [rmb%bu-cs.bu.edu@bu-it.BU.EDU: BU colloq announcements] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• consistency proof Giuseppe.Longo@THEORY.CS.CMU.EDU
  
• 1988 FOCS John Mitchell <jcm@navajo.stanford.edu>
  
• theory news circulation Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• [mcvax!doc.ic.ac.uk!pt@uunet.UU.NET: Re: theory news circulation] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• [nachum@humus.Huji.AC.IL: RTA-89 ANNOUNCEMENT] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• hello meyer
  
• Corrigendum (LICS 87 paper) mitchell wand <wand%dara75b.ccs.northeastern.edu@RELAY.CS.NET>
  
• talk by Henk Barendregt Natalie F. Tarbet <NFT@XX.LCS.MIT.EDU>
  
• [menke@harvard.harvard.edu: Colloquium Announcements] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• local distribution setup at uiuc Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• local distribution setup at uiuc kraus@b.cs.uiuc.edu (Timothy Kraus)
  
• [NIKHIL@XX.LCS.MIT.EDU: [gtl@electron.lcs.mit.edu: Practice job talk: Subtyping among Abstract Data Types]] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• [NFT@XX.LCS.MIT.EDU: Banrendregt's visit] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• [ARVIND@XX.LCS.MIT.EDU: Barendregt] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• [main@boulder.Colorado.EDU: Re: beyond omega] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• Continuations may be unreasonable Jon Riecke <riecke@THEORY.LCS.MIT.EDU>
  
• Continuations may be unreasonable Jon Riecke <riecke@THEORY.LCS.MIT.EDU>
  
• ? Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• [CFJ@XX.LCS.MIT.EDU: Friday's meeting] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• contextual full abstraction Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• Correspondence on continuity and monotonicity coraki!pratt@Sun.COM (Vaughan Pratt)
  
• [agha-gul@YALE.ARPA: CFP for newsgroup ] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• reasoning about continuations (195 lines) Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• typed versus untyped Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• Re: typed versus untyped gtl@electron.lcs.mit.edu
  
• typed versus untyped jcm@ra.stanford.edu (John Mitchell)
  
• Your counterexample Mitchell Wand <wand%corwin.ccs.northeastern.edu@RELAY.CS.NET>
  
• CPS-conversion and reasoning Jon Riecke <riecke@THEORY.LCS.MIT.EDU>
  
• Your counterexample: Why Reason About Continuations? Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• new results on polymorphism meseguer@csl.sri.com (Jose Meseguer)
  
• No Subject <DEZANI%ITOINFO.BITNET%IBOINFN.BITNET@MITVMA.MIT.EDU>
  
• [Giuseppe.Longo@THEORY.CS.CMU.EDU: Re: the cmu workshop] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• Preliminary Program for 4th MFPS Workshop Michael Main <main@boulder.Colorado.EDU>
  
• Logic at Botik '89 -- Call for Papers Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• 313 lines about full abstraction from Stoughton and Meyer Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• Plotkin on Meyer-Reicke paper on Continuations (218 lines) Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• [meyer: full abstraction] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• Girard in translation Paul Taylor <mcvax!doc.ic.ac.uk!pt@uunet.UU.NET>
  
• [meyer: full abstraction] meyer
  
• Complexity of ML typing jcm@ra.stanford.edu (John Mitchell)
  
• Logical Relations gtl@electron.lcs.mit.edu
  
• typing in ML+ kfoury%bu-cs.bu.edu@bu-it.BU.EDU
  
• a question on type-free objs Giuseppe.Longo@THEORY.CS.CMU.EDU
  
• Re: typing in ML+ Purandar Bhaduri <pbhaduri%cs1.wsu.edu@RELAY.CS.NET>
  
• Re: typing in ML+ Fritz Henglein <henglein@henglein.cs.nyu.edu>
  
• Wednesday June 1 Seminar Bard Bloom <bard@THEORY.LCS.MIT.EDU>
  
• [sieber: denotational versus operational semantics] Kurt Sieber <sieber%fb10vax.informatik.uni-saarland.dbp.de@RELAY.CS.NET>
  
• [kathy@TIDE.LCS.MIT.EDU: practice talk] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• type inference in ML+ Fritz Henglein <henglein@henglein.cs.nyu.edu>
  
• Re: Logical Relations jcm@ra.stanford.edu (John Mitchell)
  
• complexity of ML typing jcm@ra.stanford.edu (John Mitchell)
  
• terminology jcm@ra.stanford.edu (John Mitchell)
  
• composition of logical relations jcm@ra.stanford.edu (John Mitchell)
  
• Extending Reynolds andyp <@NSS.Cs.Ucl.AC.UK,@cvaxa.sussex.ac.uk:andyp@csta.uucp (Andrew Pitts)>
  
• denotational versus operational semantics Kurt Sieber <sieber%fb10vax.informatik.uni-saarland.dbp.de@RELAY.CS.NET>
  
• denotational versus operational semantics Kurt Sieber <sieber%fb10vax.informatik.uni-saarland.dbp.de@RELAY.CS.NET>
  
• No Subject mcvax!ruufil!ferjan@uunet.UU.NET (Fer-Jan de Vries)
  
• [matthias@rice.edu: denotational versus operational semantics] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• [hudak-paul@YALE.ARPA: Operational vs. Denotational] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• No Subject majrh <majrh%PYRAMID.SWANSEA.AC.UK@MITVMA.MIT.EDU>
  
• Natural Deduction vs. Sequenzen systems Mitchell Wand <wand%corwin.ccs.northeastern.edu@RELAY.CS.NET>
  
• specification logic and call by name rdt%QUCIS.BITNET@MITVMA.MIT.EDU
  
• No Subject majrh <majrh%PYRAMID.SWANSEA.AC.UK@MITVMA.MIT.EDU>
  
• denotational versus operational semantics reddy%reddy.cs.uiuc.edu@a.cs.uiuc.edu (Uday S. Reddy)
  
• Seminar announcement Jon Riecke <riecke@THEORY.LCS.MIT.EDU>
  
• Church-Rosser for typed systems Bard Bloom <bard@THEORY.LCS.MIT.EDU>
  
• Church-Rosser for typed systems jcm@ra.stanford.edu (John Mitchell)
  
• Church-Rosser for typed systems val@linc.cis.upenn.edu (Val Breazu-Tannen)
  
• Re: Church-Rosser for typed systems jcm@ra.stanford.edu (John Mitchell)
  
• specification logic and call by name "Kurt Sieber" <unido!sbsvax!fb10vax.sbsvax!sieber@uunet.UU.NET>
  
• Re: Bard's message on subtypes <kim@cs.williams.edu>
  
• Re: specification logic and call by name rdt%QUCIS.BITNET@MITVMA.MIT.EDU
  
• typed eta reduction Bard Bloom <bard@THEORY.LCS.MIT.EDU>
  
• typed eta reduction coraki!pratt@Sun.COM (Vaughan Pratt)
  
• Re: specification logic rdt%QUCIS.BITNET@MITVMA.MIT.EDU
  
• Re: typed eta reduction coraki!pratt@Sun.COM (Vaughan Pratt)
  
• Seminar announcement Mitchell Wand <wand%corwin.ccs.northeastern.edu@RELAY.CS.NET>
  
• typed eta reduction, subtypes, etc. jcm@ra.stanford.edu (John Mitchell)
  
• Type inference and implicit conversions "Frank J. Oles" <OLES%YKTVMV.BITNET@MITVMA.MIT.EDU>
  
• Church-Rosser for typed systems unido!gmdzi!gs2!ap@uunet.UU.NET (Axel Poigne)
  
• eta rule mcvax!margaux.inria.fr!huet@uunet.UU.NET (Gerard Huet)
  
• Reading seminar in logic -- meeting next week Jon Riecke <riecke@THEORY.LCS.MIT.EDU>
  
• specification logic, intuitionistic logic "Kurt Sieber" <unido!sbsvax!fb10vax.sbsvax!sieber@uunet.UU.NET>
  
• specification logic, intuitionistic logic "Kurt Sieber" <unido!sbsvax!fb10vax.sbsvax!sieber@uunet.UU.NET>
  
• Re: specification logic, intuitionistic logic rdt%QUCIS.BITNET@MITVMA.MIT.EDU
  
• [XMATdb5r%DDATHD21.BITNET@MITVMA.MIT.EDU: Note for the TYPES mailing list] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• [XMATdb5r%DDATHD21.BITNET@MITVMA.MIT.EDU: Note for the TYPES mailing list] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• comp adequacy and soundness ohearn%QUCIS.BITNET@MITVMA.MIT.EDU
  
• Request! Teodor Rus <rus@herky.cs.uiowa.edu>
  
• First meeting Mitchell Wand <wand%corwin.ccs.northeastern.edu@RELAY.CS.NET>
  
• [riecke@THEORY.LCS.MIT.EDU: Counterexample Albert mentioned] Jon Riecke <riecke@THEORY.LCS.MIT.EDU>
  
• Polymorphic Type Inference Frank Pfenning <Frank.Pfenning@PROOF.ERGO.CS.CMU.EDU>
  
• talk for Logic Colloq '88 jcm@ra.stanford.edu (John Mitchell)
  
• Schedule Mitchell Wand <wand%corwin.ccs.northeastern.edu@RELAY.CS.NET>
  
• Lewerentz, Tues, 7/5 Mitchell Wand <wand%corwin.ccs.northeastern.edu@RELAY.CS.NET>
  
• Logic colloq '88 BOHM%ASTROM.SPAN@STAR.STANFORD.EDU (Corrado Boehm)
  
• Danvy M 7/18, 1200 Mitchell Wand <wand%corwin.ccs.northeastern.edu@RELAY.CS.NET>
  
• Consel T 7/19, 1200 Mitchell Wand <wand%corwin.ccs.northeastern.edu@RELAY.CS.NET>
  
• OBJ3 Release goguen@csl.sri.com
  
• NO ADDRESS CHANGE Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• August Schedule Mitchell Wand <wand%corwin.ccs.northeastern.edu@RELAY.CS.NET>
  
• Stable Categories form a CCC Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• Inconsistencies in Cartesian Closed Categories Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• [david%unix.computer-science.manchester.ac.uk@NSS.Cs.Ucl.AC.UK: Call for papers] Albert R. Meyer <meyer@THEORY.LCS.MIT.EDU>
  
• [wand%corwin.ccs.northeastern.edu@RELAY.CS.NET: Seminar Schedule] types@THEORY.LCS.MIT.EDU, logic@THEORY.LCS.MIT.EDU
  
• Professorships in Italy mcvax!dipisa!longo@uunet.uu.net
  
• Mitchell's problem gray@symcom.math.uiuc.edu
  
• inheritance, coercions and polymorphism val@linc.cis.upenn.edu (Val Breazu-Tannen)
  
• talk at MIT: Curtis `Strong Typing in Scheme', 10/4/88 meyer@theory.LCS.MIT.EDU
  
• Upcoming Schedule Mitchell Wand <wand@corwin.ccs.northeastern.edu>
  
• type theory and practice jcm@ra.stanford.edu (John Mitchell)
  
• new course at Stanford jcm@ra.stanford.edu (John Mitchell)
  
• Re: new course at Stanford oravax!garrel@cu-arpa.cs.cornell.edu (Garrel Pottinger)
  
• type theory and practice Matthias Felleisen <matthias@rice.edu>
  
• [bard@theory.LCS.MIT.EDU: Pavel's address] meyer@theory.LCS.MIT.EDU
  
• Polymorphism and side effects Mads Tofte <mads%lfcs.edinburgh.ac.uk@nss.cs.ucl.ac.uk>
  
• teach untyped lambda calculus? jcm@ra.stanford.edu (John Mitchell)
  
• teach untyped lambda calculus? Matthias Felleisen <matthias@rice.edu>
  
• comments on my course outline jcm@ra.stanford.edu (John Mitchell)
  
• teach untyped lambda calculus? Matthias Felleisen <matthias@rice.edu>
  
• types and pedagogy gunter@linc.cis.upenn.edu (Carl Gunter)
  
• Reading seminar on semantics bemus@theory.LCS.MIT.EDU
  
• Upcoming seminar next week bemus@theory.LCS.MIT.EDU
  
• Re: comments on my course outline kfoury%bu-cs.BU.EDU@bu-it.bu.edu
  
• Re: teach untyped lambda calculus? jcm@ra.stanford.edu (John Mitchell)
  
• Hoare logic and lambda calculus rdt%QUCIS.BITNET@mitvma.mit.edu
  
• Un/typed lambda calculus Bob Harper (LFCS) <bob%lfcs.edinburgh.ac.uk@nss.cs.ucl.ac.uk>
  
• No Subject menke@harvard.harvard.edu (Baiba Menke)
  
• Lecture on MetaLisp pam%bu-cs.BU.EDU@bu-it.bu.edu
  
• who am I? rdt%QUCIS.BITNET@mitvma.mit.edu
  
• Polymorphism for predicate logic programs reddy%reddy.cs.uiuc.edu@a.cs.uiuc.edu (Uday S. Reddy)
  
• teaching Hoare logic "Steven M. German" <german%gte.com@relay.cs.net>
  
• Futamura @ Harvard Th 10/13 wand%corwin.ccs.northeastern.edu@relay.cs.net
  
• typed versus untyped/didactic versus logical jr.hindley <majrh%PYR.SWAN.AC.UK@mitvma.mit.edu>
  
• LICS submission deadline extended RIPBC%CUNYVM.BITNET@mitvma.mit.edu
  
• Anybody have a copy of Mycroft's thesis? mbr@donaldson.lcs.mit.edu
  
• bounded quantification and record-update problems rdt%QUCIS.BITNET@mitvma.mit.edu
  
• Re: bounded quantification and record-update problems kim@williams.edu
  
• bounded quantification and record-update problems Mitchell Wand <wand@corwin.ccs.northeastern.edu>
  
• Re: bounded quantification and record-update problems Hans Boehm <boehm@rice.edu>
  
• the Robinson-Tennent coercion thatte%cs@ucsd.edu (Satish Thatte)
  
• Re: Orphaned Response johnson@p.cs.uiuc.edu (Ralph Johnson)
  
• the number of types in PER epr%QUCIS.BITNET@mitvma.mit.edu
  
• data types and initiality John Mitchell <jcm@ra.stanford.edu>
  
• data types and initiality tobias@dash2.lcs.mit.edu (Tobias Nipkow)
  
• Re: data types and initiality thatte%cs@ucsd.edu (Satish Thatte)
  
• data types and initiality meyer@theory.LCS.MIT.EDU
  
• Observational equiv. guttag@larch.lcs.mit.edu (John Guttag)
  
• ADTs - In reply to Albert's note meyer@theory.LCS.MIT.EDU
  
• data types and initiality meyer@theory.LCS.MIT.EDU
  
• Re: initial algebras John Mitchell <jcm@ra.stanford.edu>
  
• initiality, etc. John Mitchell <jcm@ra.stanford.edu>
  
• initial algebras tobias@dash2.lcs.mit.edu (Tobias Nipkow)
  
• Re: data types and initiality jhf%chaco@lanl.gov (Joe Fasel)
  
• Impl. correctness for alg. spec.'s kamin@m.cs.uiuc.edu (Sam Kamin)
  
• Re: data types and initiality jhf%chaco@lanl.gov (Joe Fasel)
  
• data types and initiality Vaughan Pratt <coraki!pratt@sun.com>
  
• Implementation. correctness etc Carolyn Talcott <CLT@sail.stanford.edu>
  
• Penultimate algebras Vaughan Pratt <coraki!pratt@sun.com>
  
• data types and initiality Don Sannella <dts%lfcs.edinburgh.ac.uk@nss.cs.ucl.ac.uk>
  
• Re: initiality, etc. Don Sannella <dts%lfcs.edinburgh.ac.uk@nss.cs.ucl.ac.uk>
  
• EQPARITY Vaughan Pratt <coraki!pratt@sun.com>
  
• Pratt's latest example thatte%cs@ucsd.edu (Satish Thatte)
  
• Wand on final algebra semantics coraki!pratt@sun.com
  
• Re: Wand on final algebra semantics coraki!pratt@sun.com
  
• Re: Wand on final algebra semantics coraki!pratt@sun.com
  
• Pratt's conjectures thatte%cs@ucsd.edu (Satish Thatte)
  
• More on Pratt's conjectures thatte%cs@ucsd.edu (Satish Thatte)
  
• final algebras Vaughan Pratt <coraki!pratt@sun.com>