[Prev][Next][Index][Thread]

Preliminary Program for 4th MFPS Workshop


Fourth Workshop on Mathematical Foundations of Programming Semantics
 May 18-21, 1988    -    University of Colorado at Boulder
        Sponsorship by the Office of Naval Research

                    Preliminary Program

All talks will be held at the Engineering Center, Room  ECCR
2-6.   An  enclosed  map provides directions from the dormi-
tories and local motels to the Engineering Center.

WEDNESDAY, May 18

    9:00 - 9:50 Invited Tutorial Talk:  Categories  in  Com-
    puter  Science, Eric G. Wagner (IBM T.J. Watson Research
    Center).

    10:05 - 10:55 Invited Talk: Topology in Domain Theory I,
    Austin Melton (Kansas State University).

    11:10 - noon Computational  Dynamics,  David  B.  Benson
    (Washington State University).

    noon - 1:40 Lunch.

    1:40 - 2:00 A Floyd-Hoare Logic in Iteration Theories: a
    Logic   for  Unstructured  Programs,  Stephen  L.  Bloom
    (Stevens Institute) and Zoltan Esik (Bolyai Institute).

    2:00 - 2:20 On the  Expressive  Power  of  Indeterminate
    Network  Primitives, Prakash Panangaden and Vasant Shan-
    bhogue (Cornell University).

    2:20 - 2:40 Break and Discussion.

    2:40 - 3:00 Continuations in  Possible-World  Semantics,
    R.D. Tennent and K. Tobin (Queens University, Kingston).

    3:00 - 3:20 Relations between a Mathematical  Theory  of
    Evidence and Domain Theory, Steven K. Graham (University
    of Missouri, KC).

    3:20 - 3:40 Break and Discussion.

    3:40 - 4:00 Recursive Programs and  Denotational  Seman-
    tics   in  Absolute  Logics  of  Programs,  Ana  Pasztor
    (Florida International University).

    4:00 - 4:20 The Tensor Logic of  Dialectical  Processes,
    Robert E. Kent (University of Illionis, Chicago).

    4:20 - 4:30 Break 4:30 - 5:30 Session  on  Problems  and
    Research Directions, Flemming Nielson (Danmarks Tekniske
    Hojskole), Hanne Nielson (Aalborg University), and David
    A. Schmidt (Kansas State University).

THURSDAY, May 19

    9:00 - 9:50 Invited Talk: Topology in Domain Theory  II,
    Austin Melton (Kansas State University).

    10:05 - 10:55  Invited  Talk,/fR  C.A.R.  Hoare  and  He
    Jifeng (Programming Research Group, Oxford).

    11:10 - noon Failures Model as  a  Powerdomain,  Michael
    Mislove (Tulane University).

    noon - 1:40 Lunch.

    1:40 - 2:00 Adaptable Languages, Jon Shultis  (Incremen-
    tal Systems).

    2:00 -  2:20  Parallel  Graph-Reduction  with  a  Shared
    Memory Multiprocessor System, Gyorgy Revesz (IBM).

    2:20 - 2:40 Break and Discussion.

    2:40  -  3:00  How  to  Sketch  Functional   Programming
    Languages,  Charles  Wells (Case Western Reserve Univer-
    sity).

    3:00 - 3:20 Specification of Name Resolution in  a  Dis-
    tributed System, Tom Kiesler and Adrian Tang (University
    of Missouri, KC).

    3:20 - 3:40 Break and Discussion.

    3:40 - 4:00 Algebraic Construction of a Compiler, Teodor
    Rus (University of Iowa).

    4:00 - 4:20 Database Systems: A Categorical Perspective,
    Maria  Zamfir  Bleyberg  and Austin Melton (Kansas State
    University).

    4:20 - 4:30 Break 4:30 - 5:30 Session  on  Problems  and
    Research  Directions, Vijay Gehlot, Carl Gunter (Univer-
    sity  of  Pennsylvania)  and  Achim   Jung   (Technische
    Hochschule Darmstadt).

FRIDAY, May 20

    9:00 - 9:50 Invited Talk: Polynomials  in  an  Algebraic
    and Categorical Framework, Eric G. Wagner (IBM T.J. Wat-
    son Research Center).

    10:05 - 10:55 Invited Talk, C.A.R. Hoare and  He  Jifeng
    (Programming Research Group, Oxford).

    11:10 - noon Remarks on Continuous vs.  Monotone,  Typed
    vs.  Untyped,  Direct  vs.   Continuations, Higher-Order
    Computability vs. Symbol-Pushing, and Related Controver-
    sies,  Albert  R.  Meyer (M.I.T. Laboratory for Computer
    Science).

    noon - 1:40 Lunch.

    1:40 - 2:00 To be announced.

    2:00 - 2:20 Categorical Fixed Point Theorems, Philip  S.
    Mulry (Colgate University).

    2:20 - 2:40 Break and Discussion.

    2:40 - 3:00 Method of Computability as  a  Realizability
    Interpretation,   Maria   Napierala   (Oregon   Graduate
    Center).

    3:00 - 3:20 Compactness in  Domains,  Jimmie  D.  Lawson
    (Louisiana State University).

    3:20 - 3:40 Break and Discussion.

    3:40 - 4:00 Lambda Calculi with  Implicit  Type  Conver-
    sions, Frank J. Oles (IBM).

    4:00 - 4:20 Break.

    4:20 - 5:20 Semantic Parametricity: Lectures and Discus-
    sion,  A.  Scedrov (University of Pennsylvania) and P.J.
    Scott (University of Ottawa).

SATURDAY, May 21

    9:00 - 9:50 Invited Talk: EDHT-Categories and their Com-
    puter  Science  Applications,  Eric  G. Wagner (IBM T.J.
    Watson Research Center).

    10:05 - 10:55 Invited Talk, C.A.R. Hoare and  He  Jifeng
    (Programming Research Group, Oxford).

    11:10 - noon Closing Talk, Dana Scott  (Carnegie  Mellon
    University).

    noon - 1:45 Lunch.

FURTHER INFORMATION FROM:
    Michael Main
    Computer Science Department
    University of Colorado
    Boulder, CO 80309-0430
    Phone: (303) 492-7579
    main@boulder.colorado.edu

    Michael Mislove
    Mathematics Department
    Tulane University
    New Orleans, LA 70118
    Phone: (504) 865-5727
    MT05AMF@TCSCM.BITNET












































9

9