3. ICFP 1998: Baltimore, Maryland, USA

Session 1

• Yasuhiko Minamide, Jacques Garrigue:
  On the Runtime Complexity of Type-Directed Unboxing. 1-12
  
• Eelco Visser, Zine-El-Abidine Benaissa, Andrew P. Tolmach:
  Building Program Optimizers with Rewriting Strategies. 13-26
  
• John Hannan, Patrick Hicks:
  Higher-Order Arity Raising. 27-38
  
• Jörgen Gustavsson:
  A Type Based Sharing Analysis for Update Avoidance and Optimisation. 39-50
  

Session 2

• Richard B. Kieburtz:
  Taming Effects with Monadic Typing. 51-62
  
• Philip Wadler:
  The Marriage of Effects and Monads. 63-74
  
• Colin J. Taylor:
  A Theory of Core Fudgets. 75-85
  

Session 3

• Michael W. Hicks, Pankaj Kakkar, Jonathan T. Moore, Carl A. Gunter, Scott Nettles:
  PLAN: A Packet Language for Active Networks. 86-93
  
• Robert Bruce Findler, Matthew Flatt:
  Modular Object-Oriented Programming with Units and Mixins. 94-104
  
• Martin Odersky:
  Programming with Variable Functions. 105-116
  
• Ian Mackie:
  YALE: Yet Another Lambda Evaluator Based on Interaction Nets. 117-128
  

Session 4

• Nick Benton, Andrew Kennedy, George Russell:
  Compiling Standard ML to Java Bytecodes. 129-140
  
• Zhong Shao:
  Typed Cross-Module Compilation. 141-152
  
• Sigbjorn Finne, Daan Leijen, Erik Meijer, Simon L. Peyton Jones:
  H/Direct: A Binary Foreign Language Interface for Haskell. 153-162
  
• Jon Mountjoy:
  The Spineless Tagless G-machine, naturally. 163-173
  

Session 5

• Per Bjesse, Koen Claessen, Mary Sheeran, Satnam Singh:
  Lava: Hardware Design in Haskell. 174-184
  
• Abbas Edalat, Peter John Potts, Philipp Sünderhauf:
  Lazy Computation with Exact Real Numbers. 185-194
  
• Jerzy Karczmarczuk:
  Functional Differentiation of Computer Programs. 195-203
  
• Luc Moreau:
  A Distributed Garbage Collector with Diffusion Tree Reorganisation and Mobile Objects. 204-215
  

Session 6

• Johan Nordlander:
  Pragmatic Subtyping in Polymorphic Languages. 216-227
  
• François Pottier:
  A Framework for Type Inference with Subtyping. 228-238
  
• Lennart Augustsson:
  Cayenne - a Language with Dependent Types. 239-250
  

Session 7

• Jonathan Sobel, Daniel P. Friedman:
  Recycling Continuations. 251-260
  
• Enno Scholz:
  Imperative Streams - A Monadic Combinator Library for Synchronous Programming. 261-272
  
• Jeremy Gibbons, Geraint Jones:
  The Under-Appreciated Unfold. 273-279
  
• Graham Hutton:
  Fold and Unfold for Program Semantics. 280-288
  

Session 8

• Zhe Yang:
  Encoding Types in ML-Like Languages. 289-300
  
• Karl Crary, Stephanie Weirich, J. Gregory Morrisett:
  Intensional Polymorphism in Type-Erasure Semantics. 301-312
  
• Zhong Shao, Christopher League, Stefan Monnier:
  Implementing Typed Intermediate Languages. 313-323
  
• Arne Kutzner, Manfred Schmidt-Schauß:
  A Non-Deterministic Call-by-Need Lambda Calculus. 324-335
  

Posters

• Oleg Kiselyov:
  LAND*: an AND with local bindings, a guarded LET* special form. 336
  
• Oleg Kiselyov:
  Functional Style in C++: Closures, Late Binding, and Lambda Abstractions. 337
  
• Bruce J. McAdam:
  Type Errors Confuse the Programmer (Poster Abstract). 338
  
• Robert Ennals:
  Controlled Temporal Non-Determinism for Reasoning with a Machine of Finite Speed. 339
  
• Robert Ennals:
  Verbose Typing. 340
  
• Zoran Putnik:
  On Application of Self-Similar Pictures in Education. 341
  
• Dan Russell:
  MAP: A Functional Analysis and Design Method. 342
  
• Oleg Kiselyov:
  A Delegation Language to Request Weather Products and a Scheme of Its Interpretation. 343
  
• Nancy An, Young Park:
  A Structured Approach to Retrieving Functions by Types. 344
  
• Gary Shu Ling:
  Frob - Functional Robotics. 345
  
• Daniel H. Marcos, Pablo E. Martínez López, Walter A. Risi:
  A Functional Programming Approach to Hypermedia Authoring. 346
  
• Claudia Faggian:
  A Term Calculus for Unitary Approach to Nomalization. 347
  
• Yan-David Erlich:
  Implementing Design Patterns as Language Constructs. 348
  
• Oleg Kiselyov:
  A Lazy CGI Namespace in Scheme. 349
  
• Yuchen Zhang, Yanhong A. Liu:
  Automating Derivation of Incremental Programs. 350
  
• Haiming Chen:
  Combining CFG and Recursive Functions to Get a New Language. 351
  

Last update Fri May 24 02:54:42 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page