http:^^www.cs.wesleyan.edu^~lipton^
来自「This data set contains WWW-pages collect」· EDU^~LIPTON^ 代码 · 共 370 行
EDU^~LIPTON^
370 行
Date: Thursday, 21-Nov-96 21:33:19 GMTServer: NCSA/1.1MIME-version: 1.0Content-type: text/htmlLast-modified: Tuesday, 22-Oct-96 21:50:16 GMT<body><TITLE>Jim Lipton HyperMedia Plan File</TITLE><H1><!WA0><iMG SRC="http://allegory.cs.wesleyan.edu/GIF/Tolkien.gif">Jim Lipton</H1><H5>(Well, this isn't me, but I'll get a picture on here eventually...)</H5><H4>Asst. Prof. of Computer Science, Dept. of Mathematics, Wesleyan University. </H4><P><table><tr><td>Email:<!WA1><a href = mailto:lipton@wesleyan.edu>lipton@wesleyan.edu</a></td><tr><td>Phone: +1 (203) 685-2188</td></tr><tr><td>Fax: +1 (203) 685-2571</td></tr></table><p><H3>See if I'm logged in:</H3>Click <!WA2><A HREF="http://cs.indiana.edu/finger/allegory.cs.wesleyan.edu/lipton/w">here</A> to 'finger' me in the CS dept.<P><H3><!WA3><A HREF="http://www.cs.wesleyan.edu/~lipton/may_send96.ps">CV</a></H3><H3>Research Topics</H3><UL>Relational Programming, Categories and Logic Programming,Intuitionistic Semantics, Constructive set theory, Linear Logic.</UL><P><H3>Currently available papers/manuscripts</H3><menu> <li> "A new Framework for Declarative Programming" (with Peter Freyd and Stacy Finkelstein) <!WA4><A HREF="http://www.cs.wesleyan.edu/~lipton/jftp/dist96-nfdp.ps"> dist96-nfdp.ps </A> <!WA5><A HREF="http://www.cs.wesleyan.edu/~lipton/jftp/dist96-nfdp.dvi"> dist96-nfdp.dvi </A> Categorical Syntax and Semantics for Logic Programming, used to give a new treatment to weak Hereditarily Harrop logic programming with constraints. Submitted to <i>TCS</i>. <li>"Logic Programming in Tau Categories"(with Peter Freyd and Stacy Finkelstein) <!WA6><AHREF="http://www.cs.wesleyan.edu/~lipton/jftp/ffl2-csl94.ps"> .PS </A> file, expanded version of a paper in <i>Proc. Computer Science Logic '94, LNCS 933,</i> Springer.<li>"Some Intuitions Behind RealizabilitySemantics for Intuitionistic Logic: Tableaux and LauchliCountermodels", ( with Michael O'Donnell) <br> to appear in the <i>Annals of Pure and Applied Logic</i>. <!WA7><AHREF="http://www.cs.wesleyan.edu/~lipton/jftp/final-apal96.ps">postscript</a>file, <!WA8><A HREF="http://www.cs.wesleyan.edu/~lipton/jftp/final-apal96.dvi">dvi</a> file.<li>"Realizability, SetTheory and Term Extraction", from <i>Cahiers du Centre Logique de L'Universite Catholique de Louvain</i>, 1995. <!WA9><AHREF="http://www.cs.wesleyan.edu/~lipton/jftp/cahiers.dvi"> .DVI </A> file. <!WA10><AHREF="http://www.cs.wesleyan.edu/~lipton/jftp/cahiers.ps"> .ps </A> file.<li>"Provability in TBLL: a Decision Procedure" (with J. Chirimar), 1993 expanded version of a <i>CSL '91</i> paper, LNCS 626, Springer. <!WA11><AHREF="http://www.cs.wesleyan.edu/~lipton/jftp/tbll93.dvi"> .DVI </A> file, <!WA12><AHREF="http://www.cs.wesleyan.edu/~lipton/jftp/tbll93.ps"> .PS </A> file.<li>"Combinatory Logic Programming:Computing in Relation Calculi"(with P. Broome) <!WA13><A HREF="http://www.cs.wesleyan.edu/~lipton/jftp/dist-ilps94.dvi"> .DVI </A>file, <!WA14><AHREF="http://www.cs.wesleyan.edu/~lipton/jftp/dist-ilps94.ps"> .PS </A>file. Revised version of paper in <i>Proc. Int. Logic Programming Symposium</i> (ILPS '94), Ithaca, MIT Press<li>"A relational realizability model of intuitionistic logic"(with Michael O'Donnell) <!WA15><AHREF="http://www.cs.wesleyan.edu/~lipton/jftp/dist-mscs94.dvi"> .DVI </A> file,<!WA16><AHREF="http://www.cs.wesleyan.edu/~lipton/jftp/dist-mscs94.ps"> .PS </A> file,<i> MSCS-94, Slovakia, in LNCS,</i> springer. <li> <!WA17><AHREF="http://www.cs.wesleyan.edu/~lipton/jftp/"> all my files available via anonymous ftp </A> </menu><H3>ONR grant</H3><UL>Info on the Project: <!WA18><A HREF="http://www.cs.wesleyan.edu/~lipton/ONR/4331-001-srp-01.html">"Computing with Relations"</A></UL><HR><STRONG>Other Wesleyan Home Pages</STRONG><UL><LI><!WA19><A href=http://www.cs.wesleyan.edu> <!WA20><iMG SRC="http://www.cs.wesleyan.edu/GIF/shield-small.gif"><B>Wesleyan University</B></a> <P><LI><!WA21><A href=http://www.humanres.wesleyan.edu/phone/> Wesleyan Staff Phone list</a><li><!WA22><a href="http://www.wesleyan.edu/its/index.html">Information Technology Services at Wesleyan</a><li><!WA23><a href="http://www.wesleyan.edu/home/other.html"> Other servers at Wesleyan (including WADI student net)</a><li><!WA24><a href="http://www.wesleyan.edu/libr/wlibhome.htm"> University Libraries</a><li>Click here to <!WA25><A HREF="telnet://ctw@129.133.21.140">connect to the CTW online catalog </A> right now. <P><LI><!WA26><A HREF = "http://www.wesleyan.edu/libr/card.htm">Card catalog</A>, <!WA27><A HREF = "http://www.wesleyan.edu/libr/wlibrsrc.htm">Online catalog</A> and <!WA28><A HREF = "http://www.wesleyan.edu/libr/wlibtool.htm">Other databases</A></UL><HR><STRONG>Other Home Pages of interest</STRONG><HR><UL> <li> <!WA29><a href=http://hypatia.dcs.qmw.ac.uk> Hypatia:</a> a directory of research workers in Computer Science and Pure Mathematics,<br> and a library of their papers. <LI><!WA30><A href=http://www.cis.upenn.edu>CIS at PENN: </A> Department of Computer and Information Science <LI><!WA31><A href=http://www.cl.cam.ac.uk>University of Cambridge Computer Lab</A> <LI><!WA32><A href=http://www.di.unipi.it>University of Pisa (di.unipi.it)</A>Department of Computer Science <LI> <li><!WA33><A href=http://www.di.unipi.it/di/groups/lp/>University of Pisa Logic Programming Group</A>.<!WA34><A href=http://www.cis.upenn.edu/~dale/lProlog/index.html>Lambda-Prolog</A>home page <LI><!WA35><a href=http://www.clip.dia.fi.upm.es/> CLIP: Computational Logic, Implementation, and Parallelism Lab</a> Polytechnic University of Madrid. <li><!WA36><A href=http://www.comlab.ox.ac.uk>Oxford Computing Lab </A>home page<LI> <!WA37><A HREF="http://www.csl.sri.com/linear/sri-csl-ll.html"> Linear Logic</A> home page at SRI International. <LI> <!WA38><A HREF="http://e-math.ams.org/"> American Mathematical Society</A> home page. <LI><!WA39><a href="http://www.newton.cam.ac.uk/"> Isaac Newton Institutefor Mathematical Sciences.</A><LI><!WA40><a href="http://lmd.univ-mrs.fr/">Laboratoire de Mathematiques Discretes, Marseille-Luminy</A> <LI><!WA41><A HREF="http://www.cs.cmu.edu:8001/Web/FrontDoor.html">Front Door toCS at CMU.</A><LI><!WA42><a href="http://zenon.inria.fr:8003/"> INRIA's home page.</A></UL><HR><UL><LI><!WA43><A HREF="http://www.cs.mu.oz.au/~ad/alp/archive.html"> The LP Newsletter Archive</A>.<LI> <!WA44><A HREF="gopher://trick.ntp.springer.de/">Springer-Verlag archive</A> <li><!WA45><A HREF="http://www.cs.cmu.edu/afs/cs.cmu.edu/user/mleone/web/language-people.html"> Computer Science Bibliography Glimpse Server</A><LI> <!WA46><A HREF="http://galaxy.einet.net/galaxy/Science/Mathematics.html"> Mathematical Literature on the Web.</A> <LI><!WA47><a href="gopher://newton.newton.cam.ac.uk/"> Isaac Newton Institutefor Mathematical Sciences.</A>(Gopher)<LI><!WA48><a href="http://www.research.att.com/lics/"> Annual IEEE Symposia on Logic in Computer Science.</A><LI><!WA49><A HREF="http://www.ira.uka.de/ftp/ira/bibliography/index.html"> A Collection of Computer Science Bibliographies in BibTeX Format</A>. <LI><!WA50><a href="http://www.cs.cmu.edu:8001/afs/cs.cmu.edu/user/mleone/web/language-people.html">Researchers in programming language theory, design, and implementation.</A><li> <!WA51><a href="http://www.bell-labs.com/topic/conferences/lics/"> Logic Conference listing</a></UL><h3>Some anonymous ftp directories</h3><ul><LI> <!WA52><a href="file://ftp.cis.upenn.edu/pub/papers/">Penn Logic and Computation Group</a><LI><!WA53><a href="ftp://theory.stanford.edu/pub/">Stanford Theory Group</a><LI><!WA54><a href="file://ftp.dcs.ed.ac.uk/pub/">Edinburgh CS Department</a><LI><!WA55><a href="file://theory.doc.ic.ac.uk/theory/papers/">Imperial CS Department</a> <LI><!WA56><a href="file://boole.logique.jussieu.fr/pub/">Paris VII Equipe de Logique</a> <LI><!WA57><a href="ftp://ftp.di.unipi.it/pub/Papers/">Pisa CS Department</a><LI><!WA58><a href="ftp://gatekeeper.pa.dec.com/pub/DEC/SRC/research-reports/">DEC SRC</a></ul><hr><h3>Some internet resources in Computing</h3><!WA59><a href="http://cra.org">= Computing Research Organization.</a> Has lots of stuff of interest topotential grad studentss, in particular a link to a NRC study ranking 108schools in 20 different areas.<!WA60><a href="http://www.cs.princeton.edu/OtherCS.html">= a link via princeton, to lots of CS depts</a><h3>Some internet resources in Logic Programming</h3><dl><dt><!WA61><a href="http://www.comlab.ox.ac.uk/archive/logic-prog.html">The World Wide Web Virtual Library: Logic Programming</a><dd>Virtual Library Computing Languages AI . Logic Programming . ...<br> --- [568] <cite>http://www.comlab.ox.ac.uk/archive/logic-prog.html (32K)</cite></dl><dl><dt><!WA62><a href="http://www.cs.kuleuven.ac.be/~lpai/">Logic Programming and Artificial Intelligence Group of the KULeuven</a><dd>Logic Programming and Artificial Intelligence Research Group at the K.U. Leuven . Welcome to the WWW page of the LPAI (Logic Programming and Artificial Intelligence) Research Group at the Department of Computer Science at the Katholieke ...<br> --- [567] <cite>http://www.cs.kuleuven.ac.be/~lpai/ (2K)</cite><p></dl><dl><dt><!WA63><a href="http://laotzu.doc.ic.ac.uk/">Welcome to the Logic Programming Section</a><dd>, Department of Computing, Imperial College. This is a World Wide Web server. It provides local section information as well as information from servers around the world. Our server is situated on laotzu.doc.ic.ac.uk. . Logic Programming ...<br> --- [566] <cite>http://laotzu.doc.ic.ac.uk/ (3K)</cite></dl><p><dt><!WA64><a href=http://www.cs.mu.oz.au/~ad/alp/info-alp.html> The Association for Logic Programming - ALP</a><dd><hr><h2>Other interesting pages</h2><h3> Read about Limitations of Freedom of Speech on the Internet<!WA65><a href="http://www.vtw.org/speech/">WWW page.</a> and what you can do about it. </H3>The US Congresshas passed sweeping legislation that will restrict speech on onlinenetworks throughout the country. What you see, read, and write inpublic will be curtailed because of this legislation.<hr> Some quotes taken from the student net at Wesleyan...<UL> <li><cite> "More computing sins are committed in the name of efficiency (without necessarily achieving it) than for any other single reason - including blind stupidity."</cite> W.A. Wulf <li><cite> "We should forget about small efficiencies, say about 97% of the time: premature optimization is the root of all evil." </cite> Donald Knuth <li> <cite>"The best is the enemy of the good." </cite> Voltaire </ul><hr><P> <!WA66><ahref="http://www.cs.wesleyan.edu"> <!WA67><iMG SRC="http://www.cs.wesleyan.edu/GIF/shield-small.gif"><B>Wesleyan University</B></a> <P><i>Return to the wesleyan home page at any time by clicking on the Wesleyan Shield.</i><p>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?