Functional and logic programming. 4th Fuji international symposium, FLOPS '99, Tsukuba, Japan, November 11--13, 1999. Proceedings
The articles of mathematical interest will be reviewed individually. Indexed articles: \textit{González-Moreno, J. C.; Hortalá-González, M. T.; Rodríguez-Artalejo, M.}, Semantics and types in functional logic programming, 1-20 [Zbl 0988.68037] \textit{Hinze, Ralf}, Polytypic programming with ease (Extended abstract), 21-36 [Zbl 0988.68530] \textit{Camarão, Carlos; Figueiredo, Lucília}, Type inference for overloading without restrictions, declarations or annotations, 37-52 [Zbl 0988.68532] \textit{Barthe, Gilles; Serpette, Bernard P.}, Partial evaluation and non-interference for object calculi, 53-67 [Zbl 0988.68049] \textit{Chakravarty, Manuel M. T.}, Lazy lexing is fast, 68-84 [Zbl 0988.68529] \textit{Caballero, Rafael; López-Fraguas, Francisco J.}, A functional-logic perspective of parsing, 85-99 [Zbl 0988.68524] \textit{Lux, Wolfgang}, Implementing encapsulated search for a lazy functional logic language, 100-113 [Zbl 0988.68528] \textit{Kühnemann, Armin}, Comparison of deforestation techniques for functional programs and for tree transducers, 114-130 [Zbl 0988.68533] \textit{Ogawa, Mizuhito}, Automatic verification based on abstract interpretation, 131-146 [Zbl 0988.68540] \textit{Alpuente, María; Falaschi, Moreno; Moreno, Ginés; Vidal, Germán}, A transformation system for lazy functional logic programs, 147-162 [Zbl 0988.68507] \textit{Verbaeten, Sofie; De Schreye, Danny}, Termination analysis of tabled logic programs using mode and type information, 163-178 [Zbl 0988.68038] \textit{Ohlebusch, Enno}, On quasi-reductive and quasi-simplifying deterministic conditional rewrite systems, 179-193 [Zbl 0988.68093] \textit{Fernández, Antonio J.; Hill, Patricia M.}, An interval lattice-based constraint solving framework for lattices, 194-208 [Zbl 0988.68034] \textit{de Moor, Oege; Sittampalam, Ganesh}, Higher order matching for program transformation, 209-224 [Zbl 0988.68541] \textit{Bakewell, Adam; Runciman, Colin}, Automated generalisation of function definitions, 225-240 [Zbl 0988.68526] \textit{Danvy, Olivier}, An extensional characterization of lambda-lifting and lambda-dropping, 241-250 [Zbl 0988.68525] \textit{Beierle, Christoph; Meyer, Gregor}, Using types as approximations for type checking Prolog programs, 251-266 [Zbl 0988.68517] \textit{Ridoux, Olivier; Boizumault, Patrice; Malésieux, Frédéric}, Typed static analysis: Application to groundness analysis of PROLOG and \(\lambda\)PROLOG, 267-283 [Zbl 0988.68523] \textit{Johnson, Ernie; Ramakrishnan, C. R.; Ramakrishnan, I. V.; Rao, Prasad}, A space efficient engine for subsumption-based tabled evaluation of logic programs, 284-299 [Zbl 0988.68521] \textit{Ohori, Atsushi}, The logical abstract machine: A Curry-Howard isomorphism for machine code, 300-318 [Zbl 0988.68042] \textit{Marin, Micrea; Ida, Tetsuo; Suzuki, Taro}, On reducing the search space of higher-order lazy narrowing, 319-334 [Zbl 0988.68090] \textit{Antoy, Sergio; Tolmach, Andrew}, Typed higher-order narrowing without higher-order strategies, 335-352 [Zbl 0988.68091] \textit{Hanus, Michael; Lucas, Salvador}, A semantics for program analysis in narrowing-based functional logic languages, 353-368 [Zbl 0988.68089]
scientific article; zbMATH DE number 1386151