http:^^www.cs.wisc.edu^~siff^academia.html
来自「This data set contains WWW-pages collect」· HTML 代码 · 共 133 行
HTML
133 行
Date: Tue, 05 Nov 1996 21:35:11 GMTServer: NCSA/1.5Content-type: text/htmlLast-modified: Tue, 10 Sep 1996 14:44:53 GMTContent-length: 3981<HTML><HEAD><TITLE>Research Interests</TITLE></HEAD><body bgcolor="#FFFFFF"><BODY><H1>Research and Academic Interests</H1><P>I am a graduate student in the area of <!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><AHREF="http://www.cs.wisc.edu/~mds/uwpl.html"> programming languages </A> inthe <!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><A HREF="http://www.cs.wisc.edu"> Department of Computer Science </A>at the <!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><A HREF="http://www.wisc.edu"> University of Wisconsin-Madison </A>.<P>I am a research assistant for <!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><AHREF="http://www.cs.wisc.edu/~reps/reps.html"> Professor Tom Reps </A>. Ourresearch group, <!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><A HREF="http://www.cs.wisc.edu/wpis/html"> the WisconsinProgram Slicing Project</A>, aims to create enhanced tools to support thedevelopment of complex software systems. My research is directed (at leastfor today) towards using types and type inference to improve softwarereusability. <P>A Dilbert for the times:<H6><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><IMG SRC="http://www.cs.wisc.edu/~siff/Icons/dilbert960131-6154.smaller.gif"><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><AHREF="http://www.unitedmedia.com/comics/dilbert/archive/dilbert960131-6154.gif"><BR>(click here to see United Media's larger version)</A></H6><BR><P>Papers and Publications:<UL> <LI> <a name="tr1315">Siff, M. and Reps, T.,</a>Program generalization for software reuse: From C to C++,TR-1315, Computer Sciences Department, University of Wisconsin,Madison, WI, May 1996.(Click <!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><A HREF="http://www.cs.wisc.edu/Dienst/UI/2.0/Describe/ncstrl.uwmadison%2fCS-TR-96-1315">here</A> to access paper.)<p>To appear in ACM SIGSOFT '96 Fourth Symposium on the Foundations ofSoftware Engineering.<p></UL><P>My main academic interests lie in the application of insights andtechniques of mathematical logic and theoretical computer science to solveproblems in programming languages and compiler design.<BR><BR>Some programming language links:<UL> <LI> ML <UL> <LI> <!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><AHREF="http://www.dcs.napier.ac.uk/course-notes/sml/manual.html"> A "gentleintroduction" to ML </A> <LI> <!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><A HREF="http://www.ai.mit.edu/!info/sml/!!first"> MIT's SMLinformation tree </A> <LI> <!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><A HREF="http://pauillac.inria.fr/ocaml/">Objective Caml</A> <LI><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><A HREF="http://www.research.att.com/orgs/ssr/sml/sml-std-basis.html"> Standard ML Basis Library</A> </UL> <LI> <!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><A HREF="http://www.mjolner.dk/"> BETA </A> <LI> <!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><A HREF="http://www.cs.mu.oz.au/~winikoff/lygon/lygon.html"> Lygon</A> - a linear logic programming language</UL><BR><A NAME="THEORY">Assorted theory links:</A><UL> <LI> <!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><A HREF="http://www.dcs.gla.ac.uk/~types/"> The Types Forum </A> <LI> <!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><A HREF="http://www.cs.wisc.edu/~glaserea/uwtheory/uwtheory.html"> Theoretical Computer Science at UW-Madison </A> <LI> <!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><A HREF="http://www.cis.upenn.edu/~lc/home.html"> Logic & Computation Group at Penn </A> <LI> <!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><A HREF="http://www.cs.wisc.edu/~siff/UW-CSE-96-03-03.ps"> Theory of Computing: Goals and Directions</A> <LI> <!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><A HREF="http://www.cs.brown.edu/publications/jgaa/">Journal of Graph Algorithms and Applications</A> <LI> <!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><A HREF="http://cs-www.uchicago.edu/publications/cjtcs/"> Chicago Journal of Theoretical Computer Science </A></UL>Assorted computer science links:<UL> <LI> <!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><A HREF="http://hypatia.dcs.qmw.ac.uk">Hypatia Electronic Library</A> <LI> <!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><A HREF="http://www.cs.washington.edu:80/homes/lazowska/cra/">Computing Research </A> <LI> <!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><A HREF="http://www.physics.wisc.edu/Chaos-Complexity/"> Madison Chaos and Complex Systems Seminar </A></UL>Assorted mathematics links:<UL> <LI> <!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><A HREF="http://www.math.niu.edu/~rusin/known-math/">Mathetmatics Essays</A> <LI> <!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><A HREF="http://rendezvous.com/tangledweb/conferences/fermat/index.html"> Fermat's Last Stand </A> <LI> <!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><A HREF="http://www.mathsoft.com/asolve/constant/constant.html"> Favorite mathematical constants </A> <LI> <!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><A HREF="http://www.labri.u-bordeaux.fr/~loeb/neg/a.html"> Sets with negative number of elements </A> <LI> <!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><A HREF="http://ejc.math.gatech.edu:8080/Journal/journalhome.html"> Electronic Journal of Combinatorics </A> </UL></BODY></HTML>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?