Stop the war!

Остановите войну!

• solidarity - (ua) - (ru)
• news - (ua) - (ru)
• donate - donate - donate

for scientists:

• ERA4Ukraine
• Assistance in Germany
• Ukrainian Global University
• #ScienceForUkraine

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches

• 

Venues:

• no matches

• 

Publications:

• no matches

• 

ask others

• Google
• Google Scholar
• Semantic Scholar
• Internet Archive Scholar
• CiteSeerX
• ORCID

Refine list

refinements active!

zoomed in on ?? of ?? records

dismiss all constraints

view refined list in

dblp search

export refined list as

XML

JSON

JSONP

BibTeX

showing all ?? records

• 
  Ron K. Cytron, Peter Lee:
  Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, USA, January 23-25, 1995. ACM Press 1995, ISBN 0-89791-692-1

Held along with two workshops on January 22:
IR'95 Workshop on Intermediate Representations
SIPL'95 Workshop on State in Programming Languages

POPL 95 Server

• 
  Jon G. Riecke, Ramesh Viswanathan:
  Isolating Side Effects in Sequential Languages. 1-12
• 
  Stephen D. Brookes, Denis Dancanet:
  Sequential Algorithms, Deterministic Parallelism, and Intensional Expressiveness. 13-24
• 
  John C. Reynolds:
  Using Functor Categories to Generate Intermediate Code. 25-36

• 
  Evelyn Duesterwald, Rajiv Gupta, Mary Lou Soffa:
  Demand-driven Computation of Interprocedural Data Flow. 37-48
• 
  Thomas W. Reps, Susan Horwitz, Shmuel Sagiv:
  Precise Interprocedural Dataflow Analysis via Graph Reachability. 49-61
• 
  Vugranam C. Sreedhar, Guang R. Gao:
  A Linear Time Algorithm for Placing phi-nodes. 62-73
• 
  Rita Z. Altucher, William Landi:
  An Extended Form of Must Alias Analysis for Dynamic Allocation. 74-84

• 
  E. Allen Emerson, Kedar S. Namjoshi:
  Reasoning about Rings. 85-94
• 
  Ahmed Bouajjani, Rachid Echahed, Peter Habermehl:
  Verifying Infinite State Processes with Sequential and Parallel Composition. 95-106
• 
  Bard Bloom:
  Structured Operational Semantics as a Specification Language. 107-117

• 
  Catherine Dubois, François Rouaix, Pierre Weis:
  Generic Polymorphism. 118-129
• 
  Robert Harper, J. Gregory Morrisett:
  Compiling Polymorphism Using Intensional Type Analysis. 130-141
• 
  Xavier Leroy:
  Applicative Functors and Fully Transparent Higher-Order Modules. 142-153
• 
  Sandip K. Biswas:
  Higher-Order Functors with Transparent Signatures. 154-163

• 
  Sergei G. Vorobyov:
  Structural Decidable Extensions of Bounded Quantification. 164-175
• 
  My Hoang, John C. Mitchell:
  Lower Bounds on Type Inference with Subtypes. 176-185
• 
  Martin Hofmann, Benjamin C. Pierce:
  Positive Subtyping. 186-197

• 
  Ian Mackie:
  The Geometry of Interaction Machine. 198-208
• 
  Cormac Flanagan, Matthias Felleisen:
  The Semantics of Future and Its Use in Program Optimizations. 209-220
• 
  David Sands:
  Total Correctness by Local Improvement in Program Transformation. 221-232
• 
  Zena M. Ariola, Matthias Felleisen, John Maraist, Martin Odersky, Philip Wadler:
  The Call-by-Need Lambda Calculus. 233-246

• 
  Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, Konstantinos Sagonas, Steven Skiena, Terrance Swift, David Scott Warren:
  Unification Factoring for Efficient Execution of Logic Programs. 247-258
• 
  Klaus E. Schauser, David E. Culler, Seth Copen Goldstein:
  Separation Constraint Partitioning - A New Algorithm for Partitioning Non-strict Programs into Sequential Threads. 259-271
• 
  Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta:
  Default Timed Concurrent Constraint Programming. 272-285

• 
  Luca Cardelli:
  A Language with Distributed Scope. 286-297
• 
  Mark W. Bailey, Jack W. Davidson:
  A Formal Model of Procedure Calling Conventions. 298-310
• 
  John Plevyak, Xingbin Zhang, Andrew A. Chien:
  Obtaining Sequential Efficiency for Concurrent Object-Oriented Languages. 311-321
• 
  Todd A. Proebsting:
  Optimizing an ANSI C Interpreter with Superoperators. 322-332

• 
  Sheng Liang, Paul Hudak, Mark P. Jones:
  Monad Transformers and Modular Interpreters. 333-343
• 
  David J. King, John Launchbury:
  Structuring Depth-First Search Algorithms in Haskell. 344-354
• 
  Patrick M. Sansom, Simon L. Peyton Jones:
  Time and Space Profiling for Non-Strict Higher-Order Functional Languages. 355-366

• 
  Jens Palsberg, Patrick O'Keefe:
  A Type System Equivalent to Flow Analysis. 367-378
• 
  John Field, G. Ramalingam, Frank Tip:
  Parametric Program Slicing. 379-392
• 
  Suresh Jagannathan, Stephen Weeks:
  A Unified Treatment of Flow Analysis in Higher-Order Languages. 393-407

• 
  Giuseppe Castagna, Benjamin C. Pierce:
  Corrigendum: Decidable Bounded Quantification. 408

a service of  

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

last updated on 2024-04-30 20:00 CEST by the dblp team

 all metadata released as open data under CC0 1.0 license

see also: Terms of Use | Privacy Policy | Imprint

dblp was originally created in 1993 at:

 

since 2018, dblp has been operated and maintained by:

 

the dblp computer science bibliography is funded and supported by: