default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. FLOPS 1999: Tsukuba, Japan
- Aart Middeldorp, Taisuke Sato
:
Functional and Logic Programming, 4th Fuji International Symposium, FLOPS'99, Tsukuba, Japan, November 11-13, 1999, Proceedings. Lecture Notes in Computer Science 1722, Springer 1999, ISBN 3-540-66677-X - Juan Carlos González Moreno, Maria Teresa Hortalá-González, Mario Rodríguez-Artalejo:
Semantics and Types in Functional Logic Programming. 1-20 - Ralf Hinze:
Polytypic Programming With Ease (Extended Abstract). 21-36 - Carlos Camarão, Lucília Figueiredo:
Type Inference for Overloading without Restrictions, Declarations or Annotations. 37-52 - Gilles Barthe, Bernard P. Serpette:
Partial Evaluation and Non-interference for Object Calculi. 53-67 - Manuel M. T. Chakravarty:
Lazy Lexing is Fast. 68-84 - Rafael Caballero, Francisco Javier López-Fraguas:
A Functional-Logic Perspective on Parsing. 85-99 - Wolfgang Lux:
Implementing Encapsulated Search for a Lazy Functional Logic Language. 100-113 - Armin Kühnemann:
Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers. 114-130 - Mizuhito Ogawa:
Automatic Verification Based on Abstract Interpretation. 131-146 - María Alpuente, Moreno Falaschi, Ginés Moreno, Germán Vidal:
A Transformation System for Lazy Functional Logic Programs. 147-162 - Sofie Verbaeten, Danny De Schreye:
Termination Analysis of Tabled Logic Programs Using Mode and Type Information. 163-178 - Enno Ohlebusch:
On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems. 179-193 - Antonio J. Fernández, Patricia M. Hill:
An Interval Lattice-Based Constraint Solving Framework for Lattices. 194-208 - Oege de Moor, Ganesh Sittampalam:
Higher Order Matching for Program Transformation. 209-224 - Adam Bakewell, Colin Runciman:
Automated Generalisation of Function Definitions. 225-240 - Olivier Danvy:
An Extensional Characterization of Lambda-Lifting and Lambda-Dropping. 241-250 - Christoph Beierle, Gregor Meyer:
Using Types as Approximations for Type Checking Prolog Programs. 251-266 - Olivier Ridoux, Patrice Boizumault, Frédéric Malésieux:
Typed Static Analysis: Application to Groundness Analysis of PROLOG and lambda-PROLOG. 267-283 - Ernie Johnson, C. R. Ramakrishnan, I. V. Ramakrishnan, Prasad Rao:
A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs. 284-300 - Atsushi Ohori:
The Logical Abstract Machine: A Curry-Howard Isomorphism for Machine Code. 300-318 - Mircea Marin, Tetsuo Ida, Taro Suzuki:
On Reducing the Search Space of Higher-Order Lazy Narrowing. 319-334 - Sergio Antoy, Andrew P. Tolmach:
Typed Higher-Order Narrowing without Higher-Order Strategies. 335-353 - Michael Hanus, Salvador Lucas:
A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages. 353-368
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.
last updated on 2026-02-13 22:25 CET 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:
