Babylon, The Babel Group Virtual Library

Please send errors or omissions to aherranz @ ls fi upm es (Bibtex format preferred).

[1]

A. Herranz. From Specifications to Programs: The SLAM System. PhD thesis, Universidad Politécnica de Madrid, Facultad de Informática, June 2008. Expected. [ bib ]

[2]

Emilio Jesús Gallego Arias. Relational unificaton. Master's thesis, Facultad de Informática, Universidad Politécnica de Madrid, October 2007. Advisor: James Lipton. [ bib ]

[3]

Toufik Taibi and Ángel Herranz. Automatic proof of refinement among design patterns using the tlc. In Proceedings of the 6th WSEAS International Conference on Applied Computer Science (ACOS 2006), pages 542-547, Hangzhou, China, April 2007. [ bib ]

[4]

Juan José Moreno-Navarro Ángel Herranz. Design Pattern Formalization Techniques, chapter Modeling and Reasoning about Design Patterns in SLAM-SL. IGI Publishing, March 2007. ISBN: 978-1-59904-219-0, ISBN: 978-1-59904-221-3. [ bib ]

[5]

Julio Mariño, Ángel Herranz, and Juan José Moreno-Navarro. Demandedness analysis with partial predicates. Theory and Practice of Logic Programming, 7(1-2):153-182, January 2007. [ bib ]

[6]

Emilio Jesús Gallego Arias, Julio Mariño-Carballo, and José María Rey Poza. A proposal for disequality constraints in curry. Electr. Notes Theor. Comput. Sci., 177:269-285, 2007. [ bib ]

[7]

Emilio Jesús Gallego Arias, Julio Mariño-Carballo, and José María Rey Poza. A generic semantics for constraint functional logic programming. In Proc.of the 16th Int'l Workshop on Functional and (Constraint) Logic Programming (WFLP 2007), 2007. To appear. [ bib ]

[8]

Jonathan P. Bowen and Michael G. Hinchey. Ten commandments of formal methods ...ten years later. Computer, 39(1):40-48, 2006. [ bib | DOI ]

[9]

Angel Herranz and Pablo Nogueira. More than parsing. In Francisco Javier López Fraguas, editor, Spanish V Conference on Programming and Languages (PROLE 2005), pages 193-202. Thomson Paraninfo, September 2005. [ bib | .pdf ]

[10]

Julio Mariño and José María Rey. Adding constraints to curry via flat guards. In Michael Hanus, editor, First Workshop on Curry and Functional Logic Programming. ACM Press, September 2005. [ bib ]

[11]

Emilio Jesús Gallego and Julio Mariño. An overview of the sloth2005 curry system. In Michael Hanus, editor, First Workshop on Curry and Functional Logic Programming. ACM Press, September 2005. [ bib ]

[12]

J.G. Ramos, J. Silva, and G. Vidal. Fast narrowing-driven partial evaluation for inductively sequential programs. In Benjamin Pierce, editor, International Conference on Functional Programming, ICFP05, pages 228-239. ACM Press, September 2005. [ bib ]

[13]

Emilio Jesús Gallego Arias and Julio Mariño. An overview of the Sloth2005 Curry system: system description. In WCFLP '05: Proceedings of the 2005 ACM SIGPLAN workshop on Curry and functional logic programming, pages 66-69, New York, NY, USA, 2005. ACM Press. [ bib | DOI ]

[14]

Pablo Nogueira. The gist of side effects in pure functional languages, 23 September 2004. manuscript. [ bib | .ps.gz ]

[15]

Manuel Carro, Julio Mariño, Ángel Herranz, and Juan José Moreno-Navarro. Teaching how to derive correct concurrent programs from state-based specifications. Full paper, September 2004. [ bib | .ps.gz | Abstract ]

[16]

Ralf Lämmel and Simon Peyton Jones. Scrap more boilerplate: reflection, zips, and generalised casts. ACM SIGPLAN Notices, 39(9):244-255, September 2004. [ bib ]

[17]

Angel Herranz and Julio Mariño. Por otra ruta, por favor (cupcam 2003, problema e, solución). Novatica, 1(170):73, July 2004. Sección “Programar es crear”. [ bib | .pdf ]

[18]

José A. Leiva and Ángel Herranz. Un refactorizador simple (cupcam 2003, problema d, solución). Novatica, 1(169):74, May 2004. Sección “Programar es crear”. [ bib | .pdf ]

[19]

Julio Mariño, Juan José Moreno-Navarro, and Susana Muñoz. Constructive intensional negation. In Stuckey and Kameyama, editors, Functional and Logic Programming Symposium, number 2998 in Lecture Notes in Computer Science, pages 39-54, Nara, Japan, April 2004. Springer. [ bib ]

[20]

Manuel Carro, Julio Mariño, Ángel Herranz, and Juan José Moreno Navarro. Teaching how to derive correct concurrent programs (from state-based specifications and code patterns). In C.N. Dean and R.T. Boute, editors, Teaching Formal Methods, CoLogNET/FME Symposium, TFM 2004, Ghent, Belgium, volume 3294 of LNCS, pages 85-106. Springer, 2004. ISBN 3-540-23611-2. [ bib ]

[21]

Ángel Herranz and Julio Mariño. Por otra ruta, por favor. Novática, (170):73-75, julio/agosto 2004. Contribución a la columna Programar es Crear. [ bib ]

[22]

Peter Pepper. How to obtain powerful parsers that are elegant and practical. Technical Report 2004-01, TU Berlin, 2004. [ bib | .ps | .pdf ]

[23]

Peter Thienmann and Matthias Neubauer. Parameterised LR parsing. Barcelona, Spain, 2004. ACM SIGPLAN Workshop in Language Descriptions Tools and Applications LDTA'04. [ bib | .pdf | .pdf ]

[24]

Yifat Ben-David Kolikant. Learning concurrency: evolution of students' understanding of synchronization. Int. J. Hum.-Comput. Stud., 60(2):243-268, 2004. [ bib ]

[25]

Joshua Kerievsky. Refactoring to Patterns. Addison-Wesley, 2004. [ bib | http ]

[26]

Maurice Bruynooghe and Kung-Kiu Lau, editors. Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, volume 3049 of Lecture Notes in Computer Science. Springer, 2004. [ bib ]

[27]

Noelia Maya. Especificando el protocolo Aloha. Technical report, Facultad de Informática, Universidad Politécnica de Madrid, 2004. [ bib ]

[28]

Preeda Rajasekaran. Enhacing web service descriptions using wsdl-s. Master's thesis, B.E.,Anna University, 2004. [ bib ]

[29]

Benjamin Grosof Harold Boley, Mike Dean and Ian Horrocks. A proposal for a swrl extension to first-order logic. www.daml.org/2004/11/fol/proposal, 2004. [ bib | www: ]

[30]

Deborah L. McGuinness and Frank van Harmelen. Owl web ontology language overview. www.w3.org/TR/owl-features, 2004. [ bib | www: ]

[31]

Jerry Hobbs David Martin, Mark Burstein et al. Owl-s: Semantic markup for web services. www.daml.org/services/owl-s/1.0/owl-s.html, 2004. [ bib | .html ]

[32]

Drew McDermott. Drs: A set of conventions for representing logic languages in rdf. cs.yale.edu/homes/dvm/daml/DRSguide.pdf, 2004. [ bib | .pdf ]

[33]

David E. Langworth L. Lamport, James E. Johnson and Friedrich H. Vogt. Formal specification of web services. In Proceedings of the First International Workshop on Web Services and Formal Methods, Pisa, Italy, 2004. [ bib ]

[34]

A. Herranz and J.J. Moreno-Navarro. Formal agility. how much of each? In Taller de Metodologías Ágiles en el Desarrollo del Software. VIII Jornadas de Ingeniería del Software y Bases de Datos, JISBD 2003, pages 47-51, Alicante, España, November 2003. Grupo ISSI. [ bib | .ps.gz | Abstract ]

[35]

A. Herranz, N. Maya, and J.J. Moreno-Navarro. From executable specifications to java. In Juan José Moreno-Navarro and Manuel Palomar, editors, III Jornadas sobre Programación y Lenguajes, PROLE 2003, pages 33-44, Alicante, España, November 2003. Departamento de Lenguajes y Sistemas Informáticos, Universidad de Alicante. Depósito Legal MU-2299-2003. [ bib | .ps.gz | Abstract ]

[36]

A. Herranz and J.J. Moreno-Navarro. Rapid prototyping and incremental evolution using slam. In 14th IEEE International Workshop on Rapid System Prototyping, RSP 2003), San Diego, California, USA, June 2003. [ bib | .ps.gz | Abstract ]

[37]

A. Herranz and J.J. Moreno-Navarro. Formal extreme (and extremely formal) programming. In Michele Marchesi and Giancarlo Succi, editors, 4th International Conference on Extreme Programming and Agile Processes in Software Engineering, XP 2003, number 2675 in LNCS, pages 88-96, Genova, Italy, May 2003. [ bib | .pdf | Abstract ]

[38]

Michael Hanus, Sergio Antoy, Herbert Kuchen, Francisco J. López-Fraguas, Wolfgang Lux, Juan José Moreno-Navarro, and Frank Steiner. Curry: An Integrated Functional Logic Language, 0.8 edition, April 2003. Ed.: M. Hanus. [ bib | .html ]

[39]

Ralf Lämmel and Simon Peyton Jones. Scrap your boilerplate: a practical design pattern for generic programming. ACM SIGPLAN Notices, 38(3):26-37, March 2003. [ bib ]

[40]

Freek Wiedijk. Comparing mathematical provers. In Andrea Asperti, Bruno Buchberger, and James Davenport, editors, Proceedings of Mathematical Knowledge Management 2003, pages 188-202. Springer LNCS 2594, February 2003. [ bib | Abstract ]

[41]

Angel Herranz, Julio Mariño, Manuel Carro, and Pablo Sanchez. Almejas gigantes e interfaces de usuario (solución del programa e). Novatica, 1(161):70, January 2003. Sección “Programar es crear”. [ bib | .pdf ]

[42]

José María Rey. Demand analysis via the dynamic generation of finite domains. Available at http://babel.ls.fi.upm.es/publications, 2003. [ bib ]

[43]

S. Muñoz. A Negation System for Prolog. PhD thesis, Universidad Politécnica de Madrid, Facultad de Informática, first semester (expected) 2003. [ bib ]

[44]

Ángel Herranz, Manuel Carro, Julio Mariño, and Pablo Sánchez Torralba. Almejas gigantes e interfaces de usuario. Novática, (161):70-73, enero/febrero 2003. Contribución a la columna Programar es Crear. [ bib ]

[45]

Steven Robbins. Using remote logging for teaching concurrency. In Procs. of the 34th SIGCSE Technical Symposium on Comp. Sci. Education, pages 177-181. ACM Press, 2003. [ bib | http ]

[46]

T. Taibi and D. C. L. Ngo. Formal specification of design patterns - a balanced approach. Journal of Object Technology, 2(4):127-140, 7 2003. [ bib | http | .pdf | Abstract ]

[47]

Manfred Broy. Object-oriented programming and software development -a critical assessment. In Annaballe McIver and Carrol Morgan, editors, Programming Methodology, Monographs in Computer Science, chapter 10, pages 211-222. Springer, 2003. ISBN 0-38795349-3. [ bib ]

[48]

R. (Ralf) Lämmel and (Simon) Peyton Jones. Scrap your boilerplate: a practical design pattern for generic programming. Preprint, 2003. [ bib | .pdf | Abstract ]

[49]

Tom Mens, Tom Tourwé, and Francisca Muñoz. Beyond the refactoring browser: Advanced tool support for software refactoring, 2003. [ bib ]

[50]

Proceedings of the 25th International Conference on Software Engineering, May 3-10, 2003, Portland, Oregon, USA. IEEE Computer Society, 2003. [ bib ]

[51]

D. Ruiz. On Fairness And Multiparty Interaction. PhD thesis, University Of Sevilla, first semester 2003. [ bib ]

[52]

Harold Boley Ian Horrocks, Peter F. Patel-Schneider et al. Swrl: A semantic web rule language combining owl and ruleml. www.daml.org/2003/11/swrl/, 2003. [ bib | www: ]

[53]

A. Herranz, J.J. Moreno-Navarro, and N. Maya. Declarative reflection and its application as a pattern language. In Marco Comini and Moreno Falaschi, editors, Electronic Notes in Theoretical Computer Science, volume 76. Elsevier Science Publishers, November 2002. [ bib | .pdf | .ps.gz | Abstract ]

[54]

C. Vaucheret, S. Guadarrama, and S. Muñoz. Fuzzy Prolog: A simple general implementation using clp(r). In M. Baaz and A. Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2002, number 2514 in LNAI, pages 450-463, Tbilisi, Georgia, October 2002. Springer. [ bib ]

[55]

Ralf Lämmel and Joost Visser. Design Patterns for Functional Strategic Programming. In Proc.of Third ACM SIGPLAN Workshop on Rule-Based Programming RULE'02, Pittsburgh, USA, October 2002. ACM Press. [ bib ]

[56]

Angel Herranz, Julio Mariño, Manuel Carro, and Pablo Sanchez. No taléis el bosque por culpa de los árboles: solución. Novatica, 1(159):74, September 2002. Sección “Programar es crear”. [ bib | .pdf ]

[57]

N. Maya. Slam: Desarrollo de software a partir de especificaciones. análisis, tipos y compilación. Master's thesis, Facultad de Informática, Universidad Politécnica de Madrid, Campus de Montegancedo s/n., Boadilla del Monte, Madrid 28660, Spain, September 2002. In spanish. [ bib | .ps.gz | Abstract ]

[58]

S. Muñoz and J.J. Moreno-Navarro. Constructive negation for Prolog: A real implementation. In J.J. Moreno-Navarro and J. Mariño, editors, Joint Conference on Declarative Programming: APPIA-GULP-PRODE 2002, pages 39-52, Madrid, Spain, September 2002. [ bib ]

[59]

S. Muñoz, C. Vaucheret, and S. Guadarrama. Combining crisp and fuzzy logic in a Prolog compiler. In J.J. Moreno-Navarro and J. Mariño, editors, Joint Conference on Declarative Programming: APPIA-GULP-PRODE 2002, pages 23-38, Madrid, Spain, September 2002. [ bib ]

[60]

C. Vaucheret, S. Guadarrama, and S. Muñoz. Fuzzy Prolog: A simple general implementation using clp(r). In P.J. Stuckey, editor, International Conference in Logic Programming, ICLP 2002, number 2401 in LNCS, page 469, Copenhagen, Denmark, July/August 2002. Springer. [ bib ]

[61]

A. Herranz, J.J. Moreno-Navarro, and N. Maya. Declarative reflection and its application as a pattern language. In Marco Comini and Moreno Falaschi, editors, 11th. International Workshop on Functional and Logic Programming (WFLP'02), Grado, Italy, June 2002. University of Udine. [ bib | .ps.gz | Abstract ]

[62]

A. Herranz and J. J. Moreno-Navarro. Specifying in the large: Object-oriented specifications in the software development process. In B. J. Krämer H. Ehrig and A. Ertas, editors, The Sixth Biennial World Conference on Integrated Design and Process Technology (IDPT'02), volume 1, Pasadena, California, June 2002. Society for Design and Process Science. ISSN 1090-9389. [ bib | .ps.gz | Abstract ]

[63]

Carlos Gregorio, Angel Herranz, and Raquel Martinez. Computing curricula 2001. Novática, 1(157):47-54, May 2002. In Spanish. [ bib | .ps.gz | .pdf | Abstract ]

[64]

Julio Mariño. Semantics and Analysis of Functional Logic Programs. PhD thesis, Universidad Politécnica de Madrid, Facultad de Informática, May 2002. [ bib ]

[65]

Manuel Carro, Angel Herranz, Julio Mariño, and Pablo Sánchez. Configuración de un aeropuerto: solución. Novatica, 1(156):72, March 2002. Sección “Programar es crear”. [ bib | .pdf ]

[66]

A. Herranz and J. J. Moreno-Navarro. On the design of an object-oriented formal notation. In Fourth Workshop on Rigorous Object Oriented Methods, ROOM 4. King's College, London, March 2002. [ bib | .ps.gz | Abstract ]

[67]

Juan José Moreno-Navarro. From specifications to programs or how to construct programs in the internet age. In International Conference on Advances in Infrastructure for e-Business, e-Education, e-Science, and e-Medicine on the Internet on the Internet (SSGRR'02), L'Aquila, Italy, January 2002. [ bib ]

[68]

S. Muñoz and J.J. Moreno-Navarro. Intelligent agent to implement logic negation. In J.L. Perez de la Cruz and J. Pavon, editors, 4th Iberoamerican Workshop on Multi-Agent Systems, IBERAGENTS'02, Malaga (Spain), 2002. [ bib ]

[69]

S. Guadarrama, S. Muñoz, and C. Vaucheret. Fuzzy Prolog: A new approach using soft constraints propagation. Fuzzy Sets and Systems, FSS, 2002. [ bib ]

[70]

Ángel Herranz, Manuel Carro, Julio Mariño, and Pablo Sánchez Torralba. No taléis el bosque por culpa de los árboles. Novática, (159):74-77, septiembre/octubre 2002. Contribución a la columna Programar es Crear. [ bib ]

[71]

Manuel Carro, Julio Mariño, and Pablo Sánchez Torralba. ¡queso! Novática, (157):73-76, mayo/junio 2002. Contribución a la columna Programar es Crear. [ bib ]

[72]

Manuel Carro, Julio Mariño, and Pablo Sánchez Torralba. Configuración de un aeropuerto. Novática, (156):72-75, marzo/abril 2002. Contribución a la columna Programar es Crear. [ bib ]

[73]

Julio Mariño, Juan José Moreno-Navarro, and Susana Muñoz. A practical implementation of intensional negation. In María Alpuente, editor, Workshop on Functional and Logic Programming, pages i-j. Universidad Politécnica de Valencia, 2002. [ bib ]

[74]

Jan Kort, Ralf Lämmel, and Chris Verhoef. The grammar deployment kit. In Mark van den Brand and Ralf Lämmel, editors, Electronic Notes in Theoretical Computer Science, volume 65. Elsevier Science Publishers, 2002. [ bib ]

[75]

Ralf Lämmel and Joost Visser. Typed combinators for generic traversal. In PADL 2002: Practical Aspects of Declarative Languages, volume 2257 of Lecture Notes in Computer Science (LNCS). Springer, 2002. [ bib ]

[76]

Ralf Hinze and Johan Jeuring. Generic Haskell, Practice and Theory. In Summer School and Workshop on Generic Programming, Oxford, UK, LNCS 2297. Springer, 2002. [ bib ]

[77]

L. Cardelli N. Benton and C. Fournet. Modern Concurrency Abstractions for C#. Technical report, Microsoft Research, Cambridge, UK, 2002. [ bib ]

[78]

G. Guizzardi, H. Herre, and G. Wagner. Towards ontological foundations for UML conceptual models. 2002. [ bib | .html ]

[79]

The Joint Task Force on Computing Curricula IEEE-CS/ACM. Computing Curricula 2001 - Computer Science Volume, December 2001.
http://www.computer.org/education/cc2001/final/. [ bib ]

[80]

A. Herranz and J. J. Moreno-Navarro. Design patterns as class operators. Workshop on High Integrity Software Development at V Spanish Conference on Software Engineering, JISBD'01, November 2001. [ bib | .ps.gz | Abstract ]

[81]

A. Herranz and J.J. Moreno-Navarro. Declarative reflection and its application as a pattern language. In Fernando Orejas, Fernando Cuartero, and Diego Cazorla, editors, I Jornadas sobre Programación y Lenguajes, PROLE 2001, pages 179-197, Almagro, Spain, November 2001. [ bib | .ps.gz | Abstract ]

[82]

Joost Visser. Visitor combination and traversal control. ACM SIGPLAN Notices, 36(11):270-282, November 2001. OOPSLA 2001 Conference Proceedings: Object-Oriented Programming Systems, Languages, and Applications. [ bib ]

[83]

J. J. Moreno-Navarro and A. Herranz. Declarative reflection and its application as a pattern language. Invited Session on “Formalization of Object-Oriented Methods, Patterns, and Frameworks”, The Fifth Multi-Conference on Systemics, Cybernetics and Informatics (SCI'2001), July 2001. [ bib | .ps.gz | Abstract ]

[84]

Wolfgang Lux. Adding linear constraints over real numbers to curry. In K. Ueda H. Kuchen, editor, Proc. FLOPS 2001, number 2024 in LNCS, pages 185-200. Springer-Verlag, March 2001. [ bib ]

[85]

J. Rothe, H. Tews, and B. Jacobs. The coalgebraic class specification language CCSL. Journal of Universal Computer Science, 7(2):175-193, March 2001. [ bib | .html ]

[86]

P. Nogueira. Understanding efficient universal functions for the lambda-calculus. Technical Report BGTR-2001-01, Babel Group, School Of Computer Science, Technical University of Madrid, Campus de Montegancedo s/n., Boadilla del Monte, Madrid 28660, Spain, 2001. [ bib | .ps.gz ]

[87]

A. Herranz and J. J. Moreno-Navarro. Slam-sl Tutorial. Babel Group, School Of Computer Science, Technical University of Madrid, Campus de Montegancedo s/n., Boadilla del Monte, Madrid 28660, Spain, 2001. Draft based on A. Herranz's PhD. Thesis. [ bib | .ps.gz | Abstract ]

[88]

S. Muñoz, J.J. Moreno-Navarro, and M. Hermenegildo. Efficient negation using abstract interpretation. In R.Nieuwenhuis and A. Voronkov, editors, Logic for Programming, Artificial Intelligence and Reasoning, La Habana (Cuba), 2001. [ bib ]

[89]

C. Vaucheret, S. Guadarrama, and S. Muñoz. Fuzzy Prolog: A simple implementation using clp(R). In Constraints and Uncertainty, Paphos (Cyprus), 2001. http://www.clip.dia.fi.upm.es/
 clip/papers/fuzzy-lpar02.ps. [ bib ]

[90]

Tobias Kuipers and Joost Visser. Object-oriented tree traversal with JJForester. In Mark van den Brand and Didier Parigot, editors, Electronic Notes in Theoretical Computer Science, volume 44. Elsevier Science Publishers, 2001. Proc. of Workshop on Language Descriptions, Tools and Applications (LDTA). [ bib ]

[91]

T.S. Taft, R.A. Duff, R.L. Brukardt, and E.Ploedereder, editors. Consolidated Ada Reference Manual. Language and Standard Libraries International Standard ISO/IEC 8652/1995(E) with Technical Corrigendum 1. Springer Verlag, 2001. [ bib ]

[92]

The Joint Task Force on Computing Curricula IEEE-CS/ACM. Computing Curricula 2001 - Software Engineering Volume (en desarrollo), 2001.
http://sites.computer.org/ccse/. [ bib ]

[93]

Pascal van Eck, Joeri Engelfriet, Dieter Fensel, Frank van Harmelen, Yde Venema, and Mark Willems. A survey of languages for specifying dynamics: A knowledge engineering perspective. IEEE Transactions on Knowledge and Data Engineering, 999(12), 2001. [ bib | .pdf ]

[94]

O. Vicente. Generador y verificador de axiomas para webode. Master's thesis, Facultad de Informática, Universidad Politécnica de Madrid, 2001. [ bib ]

[95]

Timothy Budd. An Introduction to Object-oriented Programming. Addison-Wesley, 3rd edition, 2001. [ bib ]

[96]

Mel Ó Cinnéide. Automated Application of Design Patterns: a Refactoring Approach. PhD thesis, University of Dublin, Trinity College, 2001. [ bib | http | .pdf ]

[97]

L. Maranget C. Fournet, F. Le Fessant and A. Schmitt. The Jocaml language. Documentation and user's manual. Technical report, INRIA, 2001. [ bib ]

[98]

Kenneth Baclawski, Mieczyslaw K. Kokar, Paul A. Kogut, Lewis Hart, Jeffrey Smith, William S. Holmes III, Jerzy Letkowski, and Michael L. Aronson. Extending UML to support ontology engineering for the semantic Web. Lecture Notes in Computer Science, 2185:342-??, 2001. [ bib | .html ]

[99]

Marco Comini, Roberta Gori, and Giorgio Levi. Logic programs as specifications in the inductive verification of logic programs. In L. García and M.C. Meo, editors, APPIA-GULP-PRODE 2000 (AGP'2000), pages 22-38. Universidad de La Habana, December 2000. [ bib ]

[100]

A. Herranz and J. J. Moreno-Navarro. Towards automating the iterative rapid prototyping process with the slam system. In V Spanish Conference on Software Engineering, pages 217-228, November 2000. [ bib | .ps.gz | Abstract ]

[101]

J.L Fernández and A. Toval. Can intuition become rigorous? foundations for uml model verification tools. In Frances M.Titsworth, editor, International Symposium on Software Reliability Engineering, pages 344-355, San Jose, California, USA, October 8-11 2000. IEEE Press. [ bib ]

[102]

P. Nogueira. El lenguaje c- manual de referencia, tutorial y semántica formal. Master's thesis, Facultad de Informática, Universidad Politécnica de Madrid, Campus de Montegancedo s/n., Boadilla del Monte, Madrid 28660, Spain, October 2000. In spanish. [ bib | .ps.gz ]

[103]

A. Herranz, J. J. Moreno-Navarro, and J. Mariño. Demand analysis with partial predicates. In 9th International Workshop on Functional and Logic Programming (WFLP 2000), Benicassim, Spain, September 2000. Universidad Politécnica de Valencia. [ bib ]

[104]

A. Herranz and J. J. Moreno-Navarro. On the role of functional-logic languages for the debugging of imperative programs. In 9th International Workshop on Functional and Logic Programming (WFLP 2000), Benicassim, Spain, September 2000. Universidad Politécnica de Valencia. [ bib | .ps.gz | Abstract ]

[105]

Julio Mariño and Juan José Moreno Navarro. Partial predicates for demand analysis. In María Alpuente, editor, 8th. Workshop on Functional and Logic Programming, WFLP2000, pages 324-339. Universidad Politécnica de Valencia, September 2000. [ bib ]

[106]

A. Herranz and J. J. Moreno-Navarro. Generation of and debugging with logical pre and post conditions. In M. Ducasse, editor, Automated and Algorithmic Debugging 2000. TU Munich, August 2000. [ bib | .ps.gz | Abstract ]

[107]

Ralf Lämmel, Joost Visser, and Jan Kort. Dealing with large bananas. In Johan Jeuring, editor, Workshop on Generic Programming, Ponte de Lima, July 2000. Technical Report UU-CS-2000-19, Universiteit Utrecht. [ bib ]

[108]

Sergio Antoy, Rachid Echahed, and Michael Hanus. A needed narrowing strategy. Journal of the ACM, 47(4):776-822, July 2000. [ bib ]

[109]

Axel van Lamsweerde. Requirements engineering in the year 00: A research perspective. In Proc. 22nd. Internation Conference on Software Engineering, Limerick, June 2000. ACM Press. Invited paper. [ bib | .pdf ]

[110]

Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, and José Quesada. A Maude Tutorial. CSL, SRI International, March 2000. [ bib ]

[111]

S. Muñoz and J.J. Moreno-Navarro. How to incorporate negation in a Prolog compiler. In V. Santos Costa E. Pontelli, editor, 2nd International Workshop PADL'2000, volume 1753 of LNCS, pages 124-140, Boston, MA (USA), 2000. Springer. [ bib ]

[112]

S. Muñoz, J.J. Moreno-Navarro, and M. Hermenegildo. Efficient implementation of general negation using abstract interpretation. In Joint Conference on Declarative Programming, La Habana (Cuba), 2000. [ bib | .ps.gz ]

[113]

Julio Mariño and Juan José Moreno-Navarro. Using static analysis to compile non-sequential functional logic programs. In Enrico Pontelli and Vítor Santos Costa, editors, Practical Aspects of Declarative Programming (PADL 2000), volume 1753 of Lecture Notes in Computer Science, pages 63-80. Springer, January 2000. [ bib ]

[114]

C# language specification. Draft standard ECMA/TC39/TG2/2000/3, 2000. [ bib ]

[115]

Merijn de Jonge and Joost Visser. Grammars as contracts. In Generative and Component-based Software Engineering 2000, volume 2177 of Lecture Notes in Computer Science (LNCS), Erfurt, Germany, 2000. Springer-Verlag. [ bib ]

[116]

L. Kozma and T. Lakner. A programming language for teaching concurrent object-oriented concepts. In ECOOP 2000. Workshop W8. Tools and Environments for Understanding Object-Oriented Concepts, 6 2000. [ bib ]

[117]

Quality Assurance Agency for Higher Education. A report on benchmark levels for computing, 2000. Gloucester, England: Southgate House. [ bib ]

[118]

The Joint Task Force on Computing Curricula IEEE-CS/ACM. Computing Curricula 2001 - Information Systems Volume (en desarrollo), 2000.
http://www.acm.org/education/curricula.html. [ bib ]

[119]

M. Hanus (ed.), H. Kuchen, and J.J. Moreno-Navarro. Curry: An integrated functional logic language. Technical report, RWTH Aachen, 2000. [ bib | .html | Abstract ]

[120]

A.Le Guennec, G.Sunyé, and J.M. Jezequel. Precise modeling of design patterns. In Third International Conference on the Unified Modeling Language (UML2000). University of York, 2000. [ bib ]

[121]

Axel van Lamsweerde. Requirements engineering in the year 00: a research perspective. In International Conference on Software Engineering, pages 5-19, 2000. [ bib | .html ]

[122]

Axel van Lamsweerde. Formal Specification: a Roadmap. In A. Finkelstein, editor, The Future of Software Engineering, pages 147-159. ACM Press, 2000. [ bib | .html | .pdf ]

[123]

Axel van Lamsweerde. Formal Specification: a Roadmap. In A. Finkelstein, editor, The Future of Software Engineering, pages 147-159. ACM Press, 2000. [ bib | .html | .pdf ]

[124]

Axel van Lamsweerde. Formal Specification: a Roadmap. In A. Finkelstein, editor, The Future of Software Engineering, pages 147-159. ACM Press, 2000. [ bib | .html | .pdf ]

[125]

Axel van Lamsweerde. Formal Specification: a Roadmap. In A. Finkelstein, editor, The Future of Software Engineering, pages 147-159. ACM Press, 2000. [ bib | .html | .pdf ]

[126]

Koen Claessen and John Hughes. Quickcheck: a lightweight tool for random testing of haskell programs. In ICFP, pages 268-279, 2000. [ bib ]

[127]

W. R. Cook, W. L. Hill, and P. S. Canning. Inheritance Is Not Subtyping, chapter In Theoretical Aspects of Object-Oriented Programming. MIT Press, 2000. ISBN 0-262-07155-X. [ bib ]

[128]

Carl A. Gunter and John C. Mitchell. Theoretical Aspects of Object-Oriented Programming. MIT Press, 2000. ISBN 0-262-07155-X. [ bib | Abstract ]

[129]

Luca Cardelli. Bad engineering properties of object-oriented languages. Technical report, Digital Equipment Corporation, System Research Center, 2000. [ bib ]

[130]

Kent Beck. Extreme Programming Explained: Embrace Change. Addison-Wesley, Pearson Education, 2000. ISBN 201-61641-6. [ bib ]

[131]

T. A. Proebsting and B. G. Zorn. Programming shorthands. Technical Report MSR-TR-2000-03, Microsoft Research, Microsoft Corporation, One Microsoft Way, Microsoft Research, Microsoft Corporation, One Microsoft Way, January 2000. [ bib | .ps.gz ]

[132]

E. Albert, M. Hanus, and G. Vidal. Realistic program specialization in a multi-paradigm language. In María Alpuente, editor, Proceedings of WFLP'2000, pages 104-119. Universidad Politécnica de Valencia, september 2000. [ bib ]

[133]

John P. Gallagher and Julio C. Peralta. Using regular approximations for generalisation during partial evaluation. In J. Lawall, editor, Proceedings of the 2000 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'2000), Boston, Mass., pages 44-51. ACM Press, january 2000. [ bib ]

[134]

Moreno Falaschi, Patrick Hicks, and William H. Winsborough. Demand transformation analysis for concurrent constraint programs. J. Log. Program., 42(3):185-215, 2000. [ bib ]

[135]

E. Albert, M. Hanus, and G. Vidal. Realistic program specialization in a multi-paradigm language. In María Alpuente, editor, Proceedings of WFLP'2000, pages 104-119. Universidad Politécnica de Valencia, september 2000. [ bib ]

[136]

C. Fournet and G. Gonthier. The Join Calculus: a Language for Distributed Mobile Programming. Technical report, Microsoft Research. INRIA Rocquencourt, 2000. [ bib ]

[137]

L. Tokuda. Evolving Object-Oriented Designs with Refactorings. PhD thesis, University of Texas, December 1999. [ bib ]

[138]

Bill Stoddart, Steve Dunne, and Andy Galloway. Undefined expressions and logic in Z and B. Formal Methods in System Design: An International Journal, 15(3):201-215, November 1999. [ bib | .html | .ps.gz ]

[139]

F. Bueno, P. López-García, G. Puebla, and M. Hermenegildo. The Ciao Prolog Preprocessor. Technical Report CLIP8/95.0.7.20, Technical University of Madrid (UPM), Facultad de Informática, 28660 Boadilla del Monte, Madrid, Spain, November 1999. [ bib ]

[140]

M. Hermenegildo, F. Bueno, G. Puebla, and P. López. Program Analysis, Debugging and Optimization Using the Ciao System Preprocessor. In 1999 International Conference on Logic Programming, Cambridge, MA, November 1999. MIT Press. [ bib ]

[141]

M. Hermenegildo, F. Bueno, D. Cabeza, M. Carro, M. García de la Banda, P. López García, and G. Puebla. The Ciao Multi-Dialect Compiler and System: An Experimentation Workbench for Future (C)LP Systems. In Parallelism and Implementation of Logic and Constraint Logic Programming, pages 65-85. Nova Science, Commack, NY, USA, April 1999. [ bib ]

[142]

S. Peyton Jones and J. Hughes. Report on the Programming Language Haskell 98. A Non-strict Purely Functional Language, February 1999. [ bib ]

[143]

F. Durán and J. Meseguer. Structured theories and institutions. In 8th Conference on Category Theory and Computer Science (CTCS'99), volume 29 of Electronic Notes in Theoretical Computer Science. Elsevier, 1999. [ bib | .html ]

[144]

Peter Pepper. Lr parsing = grammar transformation + ll parsing making lr parsing more understandable and more efficient. Technical Report 99-05, TU Berlin, 1999. [ bib | .ps | .ps.gz ]

[145]

M. de Jonge, T. Kuipers, and J. Visser. HASDF: A generalized lr-parser generator for haskell. Technical Report SEN-R9902, CWI, 1999. available at ftp://ftp.cwi.nl/pub/CWIreports/SEN/SEN-R9902.ps.Z. [ bib | .ps.Z | .ps.Z ]

[146]

Doug Lea. Concurrent Programming in Java: Design Principles and Patterns. Addison-Wesley, 1999. [ bib | .html ]

[147]

Jeff Magee and Jeffrey Kramer. Concurrency: State Models & Java Programs. John Wiley, 1999. [ bib | http ]

[148]

Computing Science and Telecommunications Board. Being fluent wiht information technology. National Academy Press, 1999. [ bib ]

[149]

M. Buechi and W. Weck. The Greybox Approach: When Blackbox Specification Hide too much. Technical Report TUCS-TR-297a, Turku University, Findland, 1999. [ bib ]

[150]

A. H. Eden and Y. Hirshfeld. Lepus - symbolic logic modeling of object oriented architectures: A case study. In Second Nordic Workshop on Software Architecture - NOSA'99,, Ronneby, Sweden, Ago 1999. [ bib | .html | .pdf | Abstract ]

[151]

A. H. Eden, Y. Hirshfeld, and A. Yehudai. Towards a mathematical foundation for design patterns. Technical Report 1999-004, Department of Information Technology, Uppsala Universit, 1999. [ bib | .html | .pdf | Abstract ]

[152]

C. Fischer. Software development with object-z, csp and java: A pragmatic link from formal specifications to programs. Technical report, Fernuniversität Hagen, 1999. [ bib | .ps.gz | .ps.gz ]

[153]

P. Behm, P. Benoit, and J.M. Meynadier. Meteor: A Successful Application of B in a Large Project. In FM 99 - World Conference on Formal Methods in the Development of Computing Systems, number 1708 in LNCS, pages 369-387. Springer Verlag, 1999. [ bib | Abstract ]

[154]

H. Ehrig, F. Orejas, and J. Padberg. Relevance, intergration and classification of specification formalism and formal specification techniques. In Proc. FORMS, Formale Techniken für die Eisenbahnsicherung, Fortschritt-Berichte VDI, Reihe 12, Nr. 436, VDI Verlag, 2000, pages 31 - 54, 1999. [ bib ]

[155]

Leslie Lamport and Lawrence C. Paulson. Should your specification language be typed? TOPLAS, 1999. [ bib ]

[156]

Nigel Warren and Philip Bishop. Java in Practice. Addison-Wesley, 1999. [ bib ]

[157]

Iliano Cervesato. Logical frameworks - why not just classical logic? In Martina Faller, Stefan Kaufman, and Marc Pauly, editors, Proceedings of the Seventh CSLI Workshop on Logic, Language and Computation. CSLI Publications, 1999. [ bib | .html ]

[158]

G. Booch, J. Rumbaugh, and I. Jacobson. The Unified Modeling Language User Guide. Addison-Wesley Longman Inc., 1999. [ bib ]

[159]

M. Cerioli, T. Mossakowski, and H. Reichel. From total equational to partial conditional. In H.J. Kreowski, B. Krieg-Brueckner, and E. Astesiano, editors, Algebraic Foundation of Information Systems Specification, chapter 3, pages 31-104. Springer Verlag, 1999. [ bib | .ps.gz | Abstract ]

[160]

Donald Sannella and Andrzej Tarlecki. Algebraic preliminaries. In H.J. Kreowski, B. Krieg-Brueckner, and E. Astesiano, editors, Algebraic Foundation of Information Systems Specification, chapter 2, pages 31-104. Springer Verlag, 1999. [ bib ]

[161]

M. Fowler, K. Beck, J. Brant, and W.F. Opdyke. Refactoring: Improving the Design of Existing Code. Addison-Wesley, 1999. [ bib ]

[162]

Martin Fowler. Refactoring: Improving the Design of Existing Code. Addison-Wesley, 1999. [ bib ]

[163]

B. Foote and R.E. Johnson. Reflective Facilities in Smalltalk-80. In Proc. OOPSLA '89, pages 327-335, 1999. [ bib ]

[164]

Richard Bird and Ross Paterson. Generalised folds for nested datatypes. Formal Aspects of Computing, 11(2):200-222, 1999. [ bib ]

[165]

Robin Milner. Communicating and Mobile systems. The Pi Calculus. Cambridge University Press, 1999. [ bib ]

[166]

S. Tobies I. Horrocks, U. Sattler. Practical reasoning for expressive description logics. In Proceedings of the Sith Conference on Logic Programming and Automated Reasoning, 1999. [ bib ]

[167]

Gilad Bracha, Martin Odersky, David Stoutamire, and Philip Wadler. Making the Future Safe for the Past: Adding Genericity to the Java Programming Language. In OOPSLA 98, Vancouver, October 1998. [ bib ]

[168]

Gilad Bracha, Martin Odersky, David Stoutamire, and Philip Wadler. Making the future safe for the past: Adding genericity to the java programming language. In OOPSLA 98, Vancouver, October 1998. [ bib ]

[169]

Andy S. Evans. Reasoning with uml class diagrams. In Second IEEE Workshop on Industrial Strength Formal Specification Techniques, Boca Raton, Florida, October 1998. [ bib ]

[170]

G. Puebla, F. Bueno, and M. Hermenegildo. A Framework for Assertion-based Debugging in Constraint Logic Programming. In Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP'98), Pisa, Italy, October 1998. Poster. [ bib ]

[171]

Conal Elliot. Declarative event-oriented programming. Technical Report MSR-TR-98-24, Microsoft Research, Microsoft Corporation, One Microsoft Way, Microsoft Research, Microsoft Corporation, One Microsoft Way, October 1998. [ bib | .pdf ]

[172]

Etienne M. Gagnon and Laurie J. Hendren. Sablecc, an object-oriented compiler framework. In TOOLS '98: Proceedings of the Technology of Object-Oriented Languages and Systems, page 140, Washington, DC, USA, August 1998. IEEE Computer Society. [ bib ]

[173]

PITAC - Interim Report to the President.
http://www.ccic.gov/ac/interim/, August 1998. [ bib | http | .pdf ]

[174]

G. Puebla, F. Bueno, and M. Hermenegildo. A Framework for Assertion-based Debugging in Constraint Logic Programming. In Proceedings of the JICSLP'98 Workshop on Types for CLP, Manchester, UK, June 1998. [ bib ]

[175]

J.J. Moreno-Navarro and S. Muñoz. On the practical use of negation in a Prolog compiler. In M. Vilares-Ferro J.L. Freire-Nistal, M. Falaschi, editor, Joint Conference on Declarative Programming, pages 457-469, A Coruña (Spain), 1998. [ bib ]

[176]

Julio Mariño and Juan José Moreno-Navarro. Recovering sequentiality in functional logic programs. In Vilares-Ferro, editor, APPIA-GULP-PRODE'98. Universidad de La Coruña, 1998. [ bib ]

[177]

Julio Mariño and José María Rey. The implementation of Curry via its translation into Prolog. In Kuchen, editor, 7th Workshop on Functional and Logic Programming (WFLP98), number 63 in Working Papers. Westfälische Wilhelms-Universität Münster, 1998. [ bib ]

[178]

James Lipton and Robert McGrail. Encapsulating data in logic programming via categorial constraints. In PLILP'98/ALP'98: Proceedings of the 10th International Symposium on Principles of Declarative Programming, pages 391-410, London, UK, 1998. Springer-Verlag. [ bib ]

[179]

Andrew W. Appel. Modern Compiler Implementation in Java. Cambridge University Press, 1998. [ bib ]

[180]

Alan Burns and Andy Wellings. Concurrency in Ada. Cambridge University Press, 1998. [ bib ]

[181]

Yakov Persky and Mordechai Ben-Ari. Re-engineering a concurrency simulator. In Proceedings of the 6th annual conference on the teaching of computing and the 3rd annual conference on Integrating technology into computer science education, pages 185-188. ACM Press, 1998. [ bib | http ]

[182]

A.H. Eden, A. Yehudai, and J. Gil. LePUs - a Declarative Pattern Specification Language. Technical Report 326/98, Department of Computer Science, Tel Aviv University, Israel, 1998. [ bib ]

[183]

T. Mikkonen. Formalizing Design Patterns. In Proc. ICSE'98, pages 115-124. IEEE Computer Society Press, 1998. [ bib | .pdf | Abstract ]

[184]

P. Letelier, P. Sánchez, I. Ramos, and O. Pastor. OASIS 3.0: Un enfoque formal para el modelado conceptual orientado a objetos. SPUPV-98-4011, 1998. [ bib ]

[185]

Zhenyu Qian. A formal specification of java virtual machine instructions for objects, methods and subroutines. In Jim Alves-Foss, editor, Formal Syntax and Semantics of Java, LNCS. Springer Verlag, 1998. [ bib | .pdf ]

[186]

Milica Barjaktarovic and WetStone Technologies, Inc. The State-of-the-Art in Formal Methods. http://www.cs.utexas.edu/users/csed/formal-methods/docs/StateFM.pdf, January 1998. For Michael Nassiff, Rome Research Site, AFRL/IFGB, 525 Brooks Rd. Rome, NY 13441-4505. [ bib | .pdf | .pdf ]

[187]

Ulrich Hensel, Marieke Huisman, Bart Jacobs, and Hendrik Tews. Reasoning about classes in object-oriented languages: Logical models and tools. Lecture Notes in Computer Science, 1381:105-120, 1998. [ bib | .html ]

[188]

Pavel Naumov. Formalizing Reference Types in Nuprl. PhD thesis, Cornell University, 1998. [ bib | http | .pdf ]

[189]

Timothy Budd. An Introduction to Object-oriented Programming. Addison Wesley, 2nd edition, 1998. [ bib ]

[190]

Witold Charatonik and Andreas Podelski. Co-definite set constraints. In Tobias Nipkow, editor, Proceedings of the 9th International Conference on Rewriting Techniques and Applications, RTA '98, volume 1379 of LNCS, pages 211-225. Springer-Verlag, 1998. [ bib ]

[191]

Juan José Moreno-Navarro and Susana Muñoz Hernández. On the practical use of negation in a Prolog compiler. In APPIA-GULP-PRODE'98, 1998. [ bib ]

[192]

Julio Mariño and José María Rey. The implementation of curry via its translation into prolog. In Seventh Workshop on Functional and Logic Programming (WFLP98), 1998. [ bib ]

[193]

G. Puebla. Advanced Compilation Techniques based on Abstract Interpretation and Program transformation. PhD thesis, Universidad Politécnica de Madrid (UPM), Facultad Informatica UPM, 28660-Boadilla del Monte, Madrid-Spain, November 1997. [ bib ]

[194]

Manuel Blum and Hal Wasserman. Software reliability via run-time result-checking. Journal of the ACM, 44(6):826-849, November 1997. [ bib ]

[195]

D. C. Wang, A. W. Appel, J. L. Korn, and C. S. Serra. The Zephyr abstract syntax description language. In USENIX Conference on Domain-Specific Languages, pages 213-228, Berkeley, CA (USA), October 15-17 1997. USENIX Association. [ bib ]

[196]

Leszek Pacholski and Andreas Podelski. Set constraints - a pearl in research on constraints. In Gert Smolka, editor, Proceedings of the Third International Conference on Principles and Practice of Constraint Programming - CP97, volume 1330 of Springer LNCS, pages 549-561. Springer-Verlag, October 1997. [ bib ]

[197]

A. Griffiths. Modular reasoning in Object-Z. Technical Report 97-28, Software Verification Research Centre, School of Information Technology, The University of Queensland, Brisbane 4072. Australia, August 1997. This paper describes a semantic framework for reasoning about Object-Z specifications in a modular fashion. [ bib | http | .ps.gz | Abstract ]

[198]

Eelco Visser. Scannerless generalized-LR parsing. Technical Report P9707, Programming Research Group, University of Amsterdam, July 1997. [ bib | .ps.gz | .ps.gz ]

[199]

Sergio Antoy, Rachid Echahed, and Michael Hanus. Parallel evaluation strategies for functional logic languages. In International Conference on Logic Programming, pages 138-152, Leuven, Belgium, July 1997. MIT Press. [ bib ]

[200]

G. Puebla, M. García de la Banda, K. Marriott, and P. Stuckey. Optimization of Logic Programs with Dynamic Scheduling. In 1997 International Conference on LP, pages 93-107, Cambridge, MA, June 1997. MIT Press. [ bib ]

[201]

David S. Wile. Abstract syntax from concrete syntax. In Springer, editor, 19th International Conference on Software Engineering (ICSE'97), pages 472-480, May 17-23 1997. [ bib ]

[202]

Alena Griffiths. Object-oriented operations have two parts. Technical report 97-20, Software Verification Research Centre, School of Information Technology, The University of Queensland, Brisbane 4072. Australia, March 1997. [ bib | http | .ps.gz | Abstract ]

[203]

Juan José Moreno-Navarro. An introduction to program systematic development. Educational Report, Facultad de Informática, Universidad Politécnica de Madrid, 1997. In spanish. [ bib ]

[204]

S. Muñoz. Algunas técnicas para el tratamiento de información negativa en Prolog. Master's thesis, Facultad de Informática, UPM, 1997. [ bib ]

[205]

José María Rey and Julio Mariño. Implementación de Curry mediante su traducción a Prolog. Master's thesis, Facultad de Informática, Universidad Politécnica de Madrid, 1997. In Spanish. [ bib ]

[206]

Michael B. Feldman and Bruce D. Bachus. Concurrent programming can be introduced into the lower-level undergraduate curriculum. In Proceedings of the 2nd conference on Integrating technology into computer science education, pages 77-79. ACM Press, 1997. [ bib | http ]

[207]

A.H. Eden, A. Yehudai, and J. Gil. Precise Specification and Automatic Application of Design Pattern. In Proc. 12th Annual Conference on Automated Software Engineering, 1997. [ bib ]

[208]

CASL: The CoFI algebraic specification language - design proposal, 1997. [ bib | http ]

[209]

Till Mossakowski, Kolyang, and Bernd Krieg-Bruckner. Static semantic analysis and theorem proving for CASL. In Workshop on Algebraic Development Techniques, pages 333-348, 1997. [ bib | .html ]

[210]

Martin Odersky and Philip Wadler. Pizza into Java: Translating theory into practice. In Proc. 24th ACM Symposium on Principles of Programming Languages, January 1997. [ bib ]

[211]

P. López-García, M. Hermenegildo, and S. Debray. Nonfailure analysis for logic programs. In 1997 ICLP. MIT Press, 1997. [ bib ]

[212]

P. López-García, M. Hermenegildo, S. Debray, and N. W. Lin. Lower bound cost estimation for logic programs. In 1997 International Logic Programming Symposium. MIT Press, 1997. [ bib ]

[213]

M. Cerioli, A. Haxthausen, B. Krieg-Brückner, and T. Mossakowski. Permissive subsorted partial logic in CASL. In Algebraic Methodology and Software Technology (AMAST'97), number 1349 in LNCS, pages 91-107. Springer-Verlag, 1997. [ bib | .ps.gz | Abstract ]

[214]

Jeniffer Stapleton. Dynamic Systems Development Method: The Method in Practice. Addison-Wesley, Pearson Education, 1997. [ bib ]

[215]

F. Zartmann. Denotational abstract interpretation of functional logic programs. In P. Van Hentenryck, editor, Static Analysis: Proceedings of the Fourth International Symposium, volume 1302 of Lecture Notes in Computer Science, pages 141-156. Springer, 1997. [ bib ]

[216]

K. Lano, J.C. Bicarregui, and S. Goldsack. Formalising design patterns. In 1st BCS-FACS Northern Formal Methods Workshop, Ilkley, UK, September 1996. [ bib | .pdf | Abstract ]

[217]

R. Jungclaus, G. Saake, T. Hartmann, and C. Sernadas. Troll - A Language for Object-Oriented Specification of Information Systems. ACM Transactions on Information Systems, 14(2):175-211, April 1996. [ bib ]

[218]

Hubert Baumeister. Using algebraic specification languages for model oriented specifications. Technical Report MPI-I-96-2-003, MAX-PLANCK-INSTITUT FÜR INFORMATIK, February 1996. [ bib | .ps.gz ]

[219]

Herbert Kuchen, Rita Loogen, J. J. Moreno-Navarro, and M. Rodríguez-Artalejo. The functional logic language BABEL and its implementation on a graph machine. New Generation Computing, 14(4):391-427, 1996. [ bib | .html | .ps.gz | Abstract ]

[220]

J.J. Moreno-Navarro, J. Mariño, J. García Martín, A. Herranz, and A. del Pozo. Adding type-classes to functional-logic languages. In M. Martelli and M. Navarro, editors, APPIA-GULP-PRODE'96, pages 427-438. Universidad del País Vasco, Summer Courses, Basque Country University, 1996. [ bib ]

[221]

Mary Shaw and David Garlan. Software Architecture: Perspectives on an Emerging Discipline. Prentice-Hall, 1996. [ bib ]

[222]

Mary Shaw and David Garlan. Software Architecture: Perspectives on an Emerging Discipline. Prentice-Hall, 1996. [ bib ]

[223]

J-R. Abrial. The B-Book: Assigning Programs to Meanings. Cambridge University Press, 1996. [ bib ]

[224]

P.S.C. Alencar, D.D. Cowan, and C.J.P. Lucena. A Formal Approach to Architectural Design Patterns. In M.C. Gaudel and J. Woodcock, editors, FME'96: Industrial Benefit and Advances in Formal Methods, LNCS, pages 576-594. Springer Verlag, 1996. [ bib ]

[225]

J. R. Abrial. The B-Book. Cambridge University Press, 1996. [ bib ]

[226]

Edmund M. Clarke, Jeannette M. Wing, Rajeev Alur, Rance Cleaveland, David Dill, Allen Emerson, Stephen Garland, Steven German, John Guttag, Anthony Hall, Thomas Henzinger, Gerard Holzmann, Cliff Jones, Robert Kurshan, Nancy Leveson, Kenneth McMillan, J. Moore, Doron Peled, Amir Pnueli, John Rushby, Natarajan Shankar, Joseph Sifakis, Prasad Sistla, Bernhard Steffen, Pierre Wolper, Jim Woodcock, and Pamela Zave. Formal methods: State of the art and future directions. ACM Computing Surveys, 28(4):626-643, 1996. [ bib | .html ]

[227]

Jean-Raymond Abrial, Egon Börger, and Hans Langmaack, editors. Formal Methods for Industrial Applications: Specifying and Programming the Steam Boiler Control. Lecture Notes in Computer Science, 1165. Springer-Verlag Telos, cd-rom edition (february 1, 1997) edition, 10 1996. 509 pages, ISBN 3-540-61929-1. [ bib ]

[228]

J.J. Moreno-Navarro. Extending constructive negation for partial functions in lazy narrowing-based languages. In P. V. Hentenryck, editor, Proc. ELP'96. LNAI, Spinger Verlag, 1996. [ bib ]

[229]

Martín Abadi and Luca Cardelli. A Theory of Objects. Springer-Verlag, 1996. [ bib ]

[230]

Manuel G. Clavel and José Meseguer. Axiomatizing Reflective Logics and Languages, 1996. Computer Science Laboratory, SRI International, Menlo Park CA 94025. [ bib ]

[231]

P. Hudak, J. Fasel, and J. Peterson. A gentle introduction to haskell. Technical Report YALEU/DCS/RR-90, Yale University, 1996. [ bib ]

[232]

John C. Mitchell. Foundations for Programming Languages. The MIT Press, 1996. [ bib ]

[233]

Juan José Moreno-Navarro. Extending constructive negation for partial functions in lazy functional logic languages. In Extensions of Logic Programming, volume 1050 of LNAI, pages 213-228. Springer, 1996. [ bib ]

[234]

Daniela Genius. Sequential implementation of parallel narrowing. In Proc. JICSLP'96 Workshop on Multi-Paradigm Logic Programming, pages 95-104, 1996. [ bib ]

[235]

M. Falaschi, P. Hicks, and W. Winsborough. Demand transformation analysis for concurrent constraint programs. In Proc. International Conference on Logic Programming. The MIT Press, 1996. [ bib ]

[236]

Graeme Smith. Formal verification of object-z specifications. Technical report 95-55, Software Verification Research Centre, School of Information Technology, The University of Queensland, Brisbane 4072. Australia, December 1995. [ bib | http | .ps.gz | Abstract ]

[237]

L. Tokuda and D. Batory. Automated software evolution via design pattern transformations. In 3rd International Symposium on Applied Corporate Computing, Monterrey, Mexico, October 1995. [ bib | .html ]

[238]

Software Productivity Consortium, SPC Building, 2214 Rock Hill Road, Herndon, Virginia 22070, USA. Ada Quality and Style: Guidelines for Proffesional Programmers, spc-94093-cmc, version 01.00.10 edition, October 1995. Prepared for the Department of Defense Ada Joint Programm Office. [ bib ]

[239]

Charles Simonyi. The death of computer languages, the birth of intentional programming. Technical Report MSR-TR-95-52, Microsoft Research, Microsoft Corporation, One Microsoft Way, Microsoft Research, Microsoft Corporation, One Microsoft Way, September 1995. [ bib | .ps.gz ]

[240]

Julio Mariño and Juan José Moreno-Navarro. Magic set transforms for functional logic programs. In Workshop on Functional and Logic Programming, Baiersbronn-Schwarzenberg (Germany). University of Dortmund, January 1995. [ bib ]

[241]

Jim Holmes. Object oriented compiler construction. Prentice Hall, 1995. [ bib ]

[242]

Terence J. Parr and Russell W. Quong. ANTLR: A predicated-LL(k) parser generator. Software-Practice and Experience, 25(7):789-810, 1995. [ bib ]

[243]

Renhard Wilhelm and Dieter Maurer. Compiler Design. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, USA, 1995. [ bib ]

[244]

Norman H. Cohen. Ada as a Second Language. McGraw-Hill, 1995. [ bib ]

[245]

Cliff B. Jones. Systematic Software Development Using VDM. Prentice-Hall, Upper Saddle River, NJ 07458, USA, 1995. [ bib | .html ]

[246]

K. Lano. Formal Object-Oriented Development. Springer-Verlag, 1995. [ bib ]

[247]

Michal Young, Richard N. Taylor, David L. Levine, Kari A. Nies, and Debra Brodbeck. A concurrency analysis tool suite for ada programs: rationale, design, and preliminary experience. ACM Trans. Softw. Eng. Methodol., 4(1):65-106, 1995. [ bib | DOI ]

[248]

E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns - Elements of Reusable Object Oriented Software. Addison-Wesley, 1995. [ bib ]

[249]

G. Smith. Reasoning about object-z specifications. In Asia-Pacific Software Engineering Conference (APSEC '95). IEEE Computer Society Press, 1995. [ bib | .ps.gz ]

[250]

Xiaoping Jia. An approach to animating Z specifications. In COMPSAC 95, 1995. [ bib | .html ]

[251]

Daniel Jackson and Craig A. Damon. Semi-executable specifications. Technical Report 95-216, CMU School of Computer Science, 1995. [ bib | .html ]

[252]

Jonathan P. Bowen and Michael G. Hinchey. Seven more myths of formal methods. IEEE Software, 12(3):34-41, 1995. [ bib | .html ]

[253]

Jean-Raymond Abrial, Egon Börger, and Hans Langmaack. The steam boiler control specification problem. http://www.informatik.uni-kiel.de/ procos/dag9523/dag9523.html, 1995. [ bib ]

[254]

Jonathan P. Bowen and Michael G. Hinchey. Ten commandments of formal methods. IEEE Computer, 28(4):56-63, 1995. [ bib | .html ]

[255]

M. García de la Banda, K. Marriott, and P. Stuckey. Efficient analysis of constraint logic programs with dynamic scheduling. In 1995 ILPS, pages 417-431. The MIT Press, 1995. [ bib | .html ]

[256]

W. Drabent. What is a failure? An approach to constructive negation. Acta Informatica., 33:27-59, 1995. [ bib ]

[257]

F. Bueno. The CIAO Multiparadigm Compiler: A User's Manual, 1995. [ bib ]

[258]

A. Di Pierro, M. Martelli, and C. Palamidessi. Negation as instantiation. Information and Computation, 120(2):263-278, 1995. [ bib ]

[259]

Fracois-Nicola Demers and Jacques Malefant. Reflection in Logic, Functional and Object Oriented Programming: a Short Comparative Study. In Workshop on Reflection and Metalevel Arquitectures and their Applications in AI, IJCAI'95, pages 29-38, 1995. [ bib ]

[260]

John Harrison. Metatheory and Reflection in Theorem Proving: a Survey and Critique, 1995. University of Cambridge, Computer Laboratory. [ bib ]

[261]

Erik Meijer and Graham Hutton. Bananas in space: Extending fold and unfold to exponential types. In Proceedings of the 7th ACM Conference on Functional Programming Languages and Computer Architecture (FPCA'95). ACM Press, 1995. [ bib ]

[262]

C. Beierle. Type inferencing for polymorphic order-sorted logic programs. In L. Sterling, editor, Proceedings of the Twelfth International Conference on Logic Programming, pages 765-780, Cambridge, MA, 1995. MIT Press. [ bib | .dvi.gz | Abstract ]

[263]

J.W. Lloyd. Declarative programming in escher. Technical Report CSTR-95-013, University of Bristol, june 1995. [ bib ]

[264]

Colin Runciman, editor. Applications of Functional Programming. UCL Press, 1995. [ bib ]

[265]

M. Hermenegildo, F. Bueno, M. García de la Banda, and G. Puebla. The CIAO multi-dialect compiler and system: An experimentation workbench for future (C)LP systems. In Proceedings of the ILPS'95 Workshop on Visions for the Future of Logic Programming, Portland, Oregon, USA, december 1995. Available from http://www.clip.dia.fi.upm.es/. [ bib | .html ]

[266]

R. Sekar and I.V. Ramakrishnan. Fast strictness analysis based on demand propagation. Transactions on Programming Languages and Systems, 17(6):896-937, 1995. [ bib ]

[267]

T. Fujise T. Chikayama and D. Sekita. KLIC User's Manual. ICOT, 1995. [ bib ]

[268]

Duke R., Rose G., and Smith G. Object-Z: A specification language advocated for the description of standards. Technical report 94-45, Software Verification Research Centre, School of Information Technology, The University of Queensland, Brisbane 4072. Australia, December 1994. [ bib | http | .ps.gz ]

[269]

International Organization For Standardization, International Electrotechnical Comission, Intermetrics Inc. Annotated Ada Reference Manual, v6.0 edition, December 1994. ISO/IEC 8652:1995. [ bib ]

[270]

B. Liskov and J. M. Wing. A behavioural notion of subtyping. ACM Transactions on Programming Languages and Systems, 16(4):1811-1841, November 1994. [ bib ]

[271]

Juan José Moreno-Navarro. Expressivity of functional-logic languages and their implementation. In M. Alpuente and R. Barbuti, editors, Joint Conference on Declarative Programming GULP-PRODE'94. GULP (Italian ALP Chapter), Universidad Politécnica Valencia, Servicio de publicaciones Universidad Politécnica de Valencia, September 1994. [ bib | .ps.gz | Abstract ]

[272]

J. S. Dong and R. Duke. The geometry of object containment. Technical report 94-17, Software Verification Research Centre, School of Information Technology, The University of Queensland, Brisbane 4072. Australia, September 1994. [ bib | http ]

[273]

Edmund M. Clarke, Orna Grumberg, and David E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542, September 1994. [ bib | .html ]

[274]

P. Arenas, A. Gil, and F. López-Fraguas. Combining lazy narrowing with disequality constraints. Proc. LNCS, 844:385-399, September 1994. [ bib ]

[275]

Krzysztof R. Apt and Roland N. Bol. Logic Programming and Negation: a Survey. JLP, 19-20:9-72, July 1994. [ bib ]

[276]

Maarten Fokkinga. Monadic maps and folds for arbitrary datatypes. Memoranda Informatica 94-28, University of Twente, June 1994. [ bib ]

[277]

L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872-923, May 1994. [ bib ]

[278]

Lutz H. Hamel and Joseph A. Goguen. Towards a provably correct compiler for OBJ3. In PLIP'94. Springer Verlag, 1994. [ bib ]

[279]

Pei-Chi Wu and Feng-Jian Wang. The evolution of an object-oriented specification for compilers. Technical Report CSIE-94-1003, Inst. of C. Sc. and Inf. Eng. National Chiao Tung University, Taiwan, 1994. [ bib | .ps.Z | .ps.gz ]

[280]

D. Conway. Parsing with C++ classes. ACM SIGPLAN notices (USA), 29(1):46-52, January 1994. [ bib ]

[281]

A. Diller. Z: An Introduction to Formal Methods. John Wiley & Sons, 2nd edition, 1994. [ bib | http ]

[282]

Andrew Martin. Machine-Assisted Theorem-Proving for Software Engineering. PhD thesis, Pembroke College, University of Oxford, 1994. [ bib | .html | .ps.gz ]

[283]

Michael G. Hinchey and Jonathan P. Bowen. Seven more myths of formal methods: Dispelling industrial prejudices. In M. Bertran, M. Naftalin, and T. Denvir, editors, FME'94: Industrial Benefit of Formal Methods, volume 873 of Lecture Notes in Computer Science, pages 105-117. Springer-Verlag, 1994. [ bib | .html ]

[284]

E. Clarke, Orna Grumberg, and D. Long. Verification tools for finite-state concurrent systems. A Decade of Concurrency - Reflections and Perspectives, Lecture Notes in Computer Science, 803:124 ff, 1994. [ bib ]

[285]

R. Duke, P. King, G. Rose, and G. Smith. The object-z specification language. In T. Korson, V. Vaishnavi, and B. Meyer, editors, Technology of Object-Oriented Languages and Systems TOOLS 5, pages 465-483, 1994. [ bib ]

[286]

James Gosling, Bill Joy, and Guy Steele. The Java Language Specification, 1994. [ bib ]

[287]

C. Braem, B. Le Charlier, S. Modart, and P. Van Hentenryck. Cardinality analysis of Prolog. In ILPS, pages 457-471. The MIT Press, 1994. [ bib ]

[288]

P. Bruscoli, F. Levi, G. Levi, and M.C. Meo. Compilative Constructive Negation in Constraint Logic Programs. In Sophie Tyson, editor, Proc. of the Nineteenth International Colloquium on Trees in Algebra and Programming, CAAP '94, volume 787 of LNCS, pages 52-67, Berlin, 1994. Springer-Verlag. [ bib ]

[289]

P.M. Hill and J.W. Lloyd. The Gödel Programming Language. The MIT Press, 1994. [ bib ]

[290]

J.J. Moreno-Navarro. Default rules: An extension of constructive negation for narrowing-based languages. In Proc. ICLP'94, pages 535-549. The MIT Press, 1994. [ bib ]

[291]

R. F. Stark. Cut-property and negation as failure. International Journal of Foundations of Computer Science, 5(2):129-164, 1994. [ bib ]

[292]

Kim Marriot, Harald Søndergaard, and Neil Jones. Denotational abstract interpretation of logic programs. ACM Transactions on Programming Languages and Systems, 16(3):607-648, may 1994. [ bib ]

[293]

Michael O'Donnell. Equational logic programming. In Dov Gabbay, editor, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 5. Oxford University Press, 1994. [ bib ]

[294]

Sergio Antoy, Rachid Echahed, and Michael Hanus. A needed narrowing strategy. In Proc. 21st. ACM Symposium on Principles of Programming Languages, pages 268-279, Portland, Oregon, 1994. ACM Press. [ bib ]

[295]

Juan José Moreno-Navarro. Expressivity of functional logic languages and their implementation. In R. Barbuti M. Alpuente, editor, Joint Conference on Declarative Programming GULP-PRODE'94 - Tutorials, pages 11-42. GULP (Italian ALP Chapter), Universidad Politécnica de Valencia, Servicio de publicaciones Universidad Politécnica de Valencia, TR SPUPV-94.2049, september 1994. [ bib ]

[296]

Michael Hanus. The integration of functions into logic programming: from theory to practice. Journal of Logic Programming, 19 & 20:583-628, 1994. [ bib ]

[297]

Thomas Jensen. Abstract interpretation over algebraic datatypes. In 4th. International Conference on Computer Languages, pages 265-276, Tolouse, France, may 1994. IEEE Press. [ bib ]

[298]

S. K. Debray and N. W. Lin. Cost analysis of logic programs. ACM Transactions of Programming Languages and Systems, 15(5):826-875, November 1993. [ bib ]

[299]

A. Herranz. Interpretación abstracta de lenguajes lógico funcionales. Master's thesis, Facultad de Informática, Universidad Politécnica de Madrid, Campus de Montegancedo s/n., Boadilla del Monte, Madrid 28660, Spain, October 1993. In spanish. [ bib | .ps.gz | Abstract ]

[300]

Pei-Chi Wu and Feng-Jian Wang. Applying classification and inheritance into compiling. OOPS messenger, 4(4), October 1993. [ bib ]

[301]

Joseph A. Goguen, Timothy Winkler, Jose Meseguer, Kokichi Futatsugi, and Jean-Pierre Jouannaud. Introducing OBJ. Technical report, Oxford + SRI, October 1993. [ bib ]

[302]

Wendy Johnston and Gordon Rose. Guidelines for the manual conversion of Object-Z to C++. Technical report 93-14, Software Verification Research Centre, School of Information Technology, The University of Queensland, Brisbane 4072. Australia, September 1993. [ bib | http | .ps.gz ]

[303]

Alan C. Kay. The early history of smalltalk. ACM SIGPLAN Notices, 28(3):69-75, March 1993. The Second ACM SIGPLAN History of Programming Languages Conference (HOPL-II). [ bib ]

[304]

Kim Marriott and Harald Søndergaard. Precise and efficient groundness analysis for logic programs. ACM Letters on Programming Languages and Systems, 2(1-4):181-196, March-December 1993. [ bib ]

[305]

Julio Mariño, Ángel Herranz, and Juan José Moreno-Navarro. Demandedness analysis with dependence information for lazy narrowing. In W. Winsborough and S. Michaylov, editors, Workshop on Global Compilation, International Logic Programming Symposium October 26-30, 1993, Vancouver, BC, Canada, pages 99-114. Association for Logic Programming and Simon Fraser University, october 1993. Penn State University Technical Report. [ bib ]

[306]

Julio Mariño and Ángel Herranz. Specialized compilation of lazy functional logic programs. In Segundo Congreso Nacional de Programación Declarativa - 2nd Spanish Conference on Declarative Programming (ProDe'93), pages 39-55. Instituto de Investigación en Inteligencia Artificial, CSIC, 1993. [ bib ]

[307]

Juan José Moreno-Navarro, Herbert Kuchen, Julio Mariño, Stephan Winkler, and Werner Hans. Efficient lazy narrowing using demandedness analysis. In 5th International Symposium on Programming Language Implementation and Logic Programming, PLILP'93, volume 714 of Lecture Notes in Computer Science, pages 167-183. Springer, 1993. [ bib ]

[308]

Susan Stepney. High Integrity Compilation. A Case Study. Prentice Hall, 1993. [ bib ]

[309]

Pei-Chi Wu and Feng-Jian Wang. Designing a reusable symbol table. Technical Report CSIE-93-1010, Inst. of C. Sc. and Inf. Eng. National Chiao Tung University, Taiwan, 1993. [ bib | .ps.Z | .ps.gz ]

[310]

Pei-Chi Wu and Feng-Jian Wang. Message passings on a parse tree. Technical Report CSIE-94-1002, Inst. of C. Sc. and Inf. Eng. National Chiao Tung University, Taiwan, 1993. [ bib | .ps.Z | .ps.gz ]

[311]

Martin Odersky. Defining context-dependent syntax without using contexts. ACM Transactions on Programming Languages and Systems (TOPLAS), 15(3):535-562, 1993. [ bib | DOI ]

[312]

Jean Bacon. Concurrent Systems. Addison-Wesley, 1993. An integrated approach to operating systems, database, and distributed systems. [ bib ]

[313]

Narain H. Gehani. Capsules: a shared memory access mechanism for Concurrent C/ C++. IEEE Transactions on Parallel and Distributed Systems, 4(7):795-811, 1993. [ bib ]

[314]

M. Ben-Ari. Mathematical Logic for Computer Science. Prentice-Hall International Series in Computer Science. Prentice-Hall, 1993. [ bib ]

[315]

E. Dubois, P. Du Bois, and M. Petit. Object Oriented Requirement Analysis: an agent perspective. In Proceedings of the ECOOP'93, pages 458-481, 1993. [ bib ]

[316]

D. Craigen, S. Gerhart, and T.J. Ralston. An international survey of industrial applications of formal methods (volume 1: Purpose, approach, analysis and conclusions, volume 2: Case studies). Technical Report NIST GCR 93/626-V1 & NIST GCR 93-626-V2 (Order numbers: PB93-178556/AS & PB93-178564/AS), National Technical Information Service, National Technical Information Service, 5285 Port Royal Road, Springfield, VA 22161, USA, 1993. [ bib | .html ]

[317]

I. J. Hayes, C. B. Jones, and J. E. Nicholls. Understanding the differences between VDM and Z. FACS Europe, Series I, 1(1):7-30, Autumn 1993. [ bib | .ps.Z ]

[318]

M.J. Ramírez and M. Falaschi. Conditional narrowing with constructive negation. Lecture Notes in Artificial Intelligence, 660:59-79, 1993. [ bib ]

[319]

Tim Sheard and Leonidas Fegaras. A fold for all seasons. In Proceedings of the 6th Conference on Functional Programming Languages and Computer Architecture, pages 233-242, 1993. [ bib ]

[320]

Philip Wadler and R.J.M. Hughes. Projections for strictness analysis. In 5th International Symposium on Programming Language Implementation and Logic Programming, PLILP'93, volume 714 of Lecture Notes in Computer Science, pages 184-200. Springer, 1993. [ bib ]

[321]

R. C. Sekar and I. V. Ramakrishnan. Programming in equational logic: Beyond strong sequentiality. Information and Computation, 1(104):78-109, 1993. [ bib ]

[322]

Susan Stepney. High Integrity Compilation - a Case Study. Prentice Hall, 1993. [ bib ]

[323]

Alexander Aiken, Dexter Kozen, Moshe Vardi, and Ed Wimmers. The complexity of set constraints. In Börger, Gurevich, and Meinke, editors, Proc. 1993 Conference on Computer Science Logic (CSL'93), volume 832 of Lecture Notes in Computer Science. European Association for Computer Science Logic, Springer, september 1993. [ bib ]

[324]

S. Conrad, M. Gogolla, and R. Herzig. Troll light: A core language for specifying objects. Technical Report 92-02, Technische Universität Braunschweig, Informatik, Abt. Datenbanken, Postfach 3329, W-3300 Braunschweig, Germany, December 1992. [ bib | .ps.gz ]

[325]

H. Kuchen, F. López-Fraguas, J. J. Moreno-Navarro, and M. Rodríguez-Artalejo. Implementing a lazy functional logic language with disequality constraints. In K. Apt, editor, Joint International Confeence and Symposium on Logic Programming - JICSLP'92, Washington (USA), pages 207-221. Association for Logic Programming and University of Maryland, The MIT Press, November 1992. [ bib | .ps.gz | Abstract ]

[326]

Mary Shaw. We can teach software better. Computing Research News, 4(4):2-12, September 1992. [ bib ]

[327]

N. E. Fuchs. Specifications are (preferably) executable. Software Engineering Journal, September 1992. [ bib | .ps.gz | .ps.gz | Abstract ]

[328]

J. A. Jiménez, J. Mariño, and J. J. Moreno-Navarro. Efficient compilation of lazy narrowing into prolog. In T. Clement and Kung-Kiu Lau, editors, Workshop on Logic on Program Synthesis and Transformation - LOPSTR'92, Manchester (UK), page 14. University of Manchester, Workshops in Computer Science, Springer Verlag, January 1993., August 1992. [ bib | .ps.gz | Abstract ]

[329]

C. Holzbaur. Metastructures vs. attributed variables in the contex of extensible unification. Implementation and LP LNC S631, pages 260-268, August 1992. [ bib ]

[330]

Justine O. Graver. The evolution of an object-oriented compiler framework. Software - Practice and Experience, 22(7), July 1992. [ bib | Abstract ]

[331]

K. Muthukumar and M. Hermenegildo. Compile-time derivation of variable dependency using abstract interpretation. JLP, 13(2/3):315-347, July 1992. [ bib | .html ]

[332]

Richard M. Stallman. Using and porting GNU CC (version 2.0). Free Software Foundation, February 1992. [ bib ]

[333]

Julio Mariño, José Andrés Jiménez Martín, and Juan José Moreno-Navarro. Some techniques for the efficient compilation of lazy narrowing into Prolog. In Primer Congreso Nacional de Programación Declarativa - 1st Spanish Conference on Declarative Programming (ProDe'92), pages 53-68. Universidad Politécnica de Madrid, 1992. [ bib ]

[334]

Julio Mariño and Juan José Moreno-Navarro. Efficient compilation of lazy narrowing into Prolog. In Tim Clement and Kung Kiu Lau, editors, Workshop on Logic on Program Synthesis and Transformation - LOPSTR'92, Manchester (UK). ISBN 3-540-19806-7, Workshops in Computing, pages 253-270. University of Manchester, Springer Verlag, august 1992. [ bib ]

[335]

Julio Mariño. La implementación del narrowing perezoso en prolog. Master's thesis, Facultad de Informática, Universidad Politécnica de Madrid, julio 1992. In Spanish. [ bib ]

[336]

Julio Mariño and Juan José Moreno-Navarro. Some notes on lazy evaluation. In 1st Compulog Workshop on Programming Languages, Pisa. University of Pisa, april 1992. [ bib ]

[337]

Pei-Chi Wu and Feng-Jian Wang. An object-oriented specification and its generation for compilers. In ACM computer science conference, 1992. [ bib ]

[338]

Pei-Chi Wu and Feng-Jian Wang. An object oriented specification for compilers. ACM SIGPLAN notices, 27(1), January 1992. [ bib ]

[339]

Gert Smolka. Feature-constraint logics for unification grammars. Journal of Logic Programming, 12(1 and 2):51-87, January 1992. [ bib ]

[340]

R. Backofen and G. Smolka. A complete and recursive feature theory. Research report rr-92-30, DFKI Saarbrücken, 1992. [ bib ]

[341]

G. Smith. An Object-Oriented Approach to Formal Specification. PhD thesis, University of Queensland, 1992. [ bib | .ps.Z | .ps.gz ]

[342]

J. M. Spivey. The Z Notation: A Reference Manual. Prentice Hall International Series in Computer Science, 2nd edition, 1992. [ bib | http ]

[343]

J. B. Wordsworth. Software Development with Z. Addison-Wesley, 1992. [ bib ]

[344]

Lucia Rapanotti and Adolfo Socorro. Introducing foops. Technical Report PRG-TR-28-92, Oxford University Computing Laboratory, 1992. [ bib ]

[345]

C. Sernadas, P. Goureia, and A. Sernadas. Oblog: Object oriented logic based conceptual modelling. Technical report, Instituto Superior Tecnico, Lisboa, 1992. [ bib ]

[346]

Zohar Manna and Richard Waldinger. Fundamentals of deductive program synthesis, 1992. [ bib | .ps.Z ]

[347]

J. M. Spivey. The Z Notation: A Reference Manual. Prentice Hall International Series in Computer Science, 2nd edition, 1992. [ bib | http ]

[348]

J. B. Wordsworth. Software Development with Z. Addison-Wesley, 1992. [ bib ]

[349]

C. B. Jones. The search for tractable ways of reasoning about programs. Technical Report UMCS-92-4-4, Department of Computer Science, University of Manchester, 1992. [ bib | .html ]

[350]

H. Kuchen, F. López-Fraguas, J.J. Moreno-Navarro, and M. Rodríguez-Artalejo. Implementing a lazy functional logic language with disequality constraints. In Procedings of the Joint International Conference and Symposium on Logic Programming, pages 189-224. The MIT Press, 1992. [ bib ]

[351]

W.F. Opdyke. Refactoring Object-Oriented Frameworks. PhD thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1992. [ bib ]

[352]

B. Foote. Objects, Reflection, and Open Languages. In Workshop on Object-Oriented Reflection and Metalevel Architectures ECOOP '92, 1992. [ bib ]

[353]

D. Jacobs and A. Langen. Static analysis of logic programs for independent and-parallelism. Journal of Logic Programming, 13(2&3):291-314, 1992. [ bib ]

[354]

Sergio Antoy. Definitional trees. In Leach and Rodríguez Artalejo, editors, Proc. of the 4th Intl. Conf. on Algebraic and Logic Programming, ICALP'92, volume 632 of Lecture Notes in Computer Science, pages 143-157. Springer, 1992. [ bib ]

[355]

J.J. Moreno-Navarro and M. Rodríguez-Artalejo. Logic programming with functions and predicates: The language Babel. Journal of Logic Programming, 12:191-223, 1992. [ bib ]

[356]

Luc Maranget. Compiling lazy pattern matching. In International Conference on Lisp and Functional Programming. ACM Press, 1992. [ bib ]

[357]

John Alan Robinson. Logic and logic programming. Communications of the ACM, 35(3):40-65, march 1992. [ bib ]

[358]

John Grant and Jack Minker. The impact of logic programming on databases. Communications of the ACM, 35(3):66-81, march 1992. [ bib ]

[359]

Koichi Furukawa. Logic programming as the integrator of the fifth generation computer systems project. Communications of the ACM, 35(3):82-92, march 1992. [ bib ]

[360]

David Scott Warren. Memoing for logic programs. Communications of the ACM, 35(3):93-111, march 1992. [ bib ]

[361]

P.N. Benton. Strictness Analysis of Lazy Functional Programs. PhD thesis, University of Cambridge, 1992. [ bib ]

[362]

David Walker Robin Milner, Joachim Parrow. A Calculus of Mobile Processes. Technical report, Academic Press, 1992. [ bib ]

[363]

John V. Guttag and James J. Horning. A tutorial on Larch and LCL, a Larch/C interface language. In S. Prehn and W. J. Toetenel, editors, VDM91: Formal Software Development Methods. Springer-Verlag Lecture Notes in Computer Science 551, October 1991. [ bib ]

[364]

Christine Ernoult and Alan Mycroft. Uniform ideals and strictness analysis. In J. Leach, B. Monien, and M. Rodríguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium (ICALP '91), number 510 in Lecture Notes in Computer Science, pages 47-59, Madrid, Spain, July 8-12 1991. Springer. [ bib ]

[365]

Kai Koskimies. Object-orientation in attribute grammars. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 297-329. Springer Verlag, June 1991. [ bib | Abstract ]

[366]

Masaru Tomita. Generalized LR Parsing. Kluwer Academic Publishers, 1991. ISBN 0792392019. [ bib ]

[367]

David Jackson. A Mini-Course on Concurrency. In Twenty-second SIGCSE Technical Symposium on Computer Science Education, pages 92-96. ACM Press, 1991. [ bib ]

[368]

Greg Andrews. Concurrent Programming: Principles and Practice. Benjamin/Cummings, 1991. [ bib ]

[369]

C. William Higginbotham and Ralph Morelli. A system for teaching concurrent programming. In Proceedings of the twenty-second SIGCSE technical symposium on Computer science education, pages 309-316. ACM Press, 1991. [ bib | http ]

[370]

Dorian P. Yeager. Teaching concurrency in the programming languages course. In Proceedings of the twenty-second SIGCSE technical symposium on Computer science education, pages 155-161. ACM Press, 1991. [ bib | http ]

[371]

C. Sernadas, P. Goureia, and A. Sernadas. Oblog - object oriented logic: An informal introduction. Technical report, INESC, Lisbon, 1991. [ bib ]

[372]

P. Stuckey. Constructive negation for constraint logic programming. In Proc. IEEE Symp. on Logic in Computer Science, volume 660. IEEE Comp. Soc. Press, 1991. [ bib ]

[373]

A. Van Gelder, K.A. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. J. of the ACM, 38(3):620-650, 1991. [ bib ]

[374]

Timothy Budd. An Introduction to Object-oriented Programming. Addison-Wesley, 1st edition, 1991. [ bib ]

[375]

H.B.M. Jonkers. Inheritance in COLD. In Algebraic Methods: Theory, Tools and Applications (Part II, Lecture Notes in Computer Science. Sprinter Verlag, 1991. [ bib ]

[376]

S. H. Cheng and C. B. Jones. On the usability of logics which handle partial functions. In Proceedings of the 3rd. Refinement Workshop, pages 51-69, 1991. [ bib ]

[377]

C.A. Middelburg and G.R. Renardel de Labalette. Lpf and mpl_w -a logical comparison of vdm-sl and cold-k. In VDM'91 Conference Proceedings, pages 279-308. Springer Verlag, 1991. [ bib | .ps.gz ]

[378]

Hassan Ait-Kaci. Warren's Abstract Machine. A Tutorial Reconstruction. The MIT Press, Cambridge, Massachusetts. London, England, 1991. [ bib ]

[379]

Erik Meijer, Maarten Fokkinga, and Ross Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In J. Hughes, editor, Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture (FPCA'91), volume 523 of LNCS. Springer-Verlag, 1991. [ bib ]

[380]

K. Muthukumar and M. Hermenegildo. Combined determination of sharing and freeness of program variables through abstract interpretation. In Koichi Furukawa, editor, Proceedings of the Eighth International Conference on Logic Programming, pages 49-63, Paris, France, 1991. The MIT Press. [ bib ]

[381]

Jan Willem Klop. Term rewriting systems. In Samson Abramsky, Dov Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 1, chapter 6. Oxford University Press, 1991. [ bib ]

[382]

Robin Milner. The Polyadic Pi Calculus: A Tutorial. Technical Report 100(1), Information and Computation, 1991. [ bib ]

[383]

Evan Tick. Parallel Logic Programming. MIT Press, Cambridge, MA, 1991. [ bib ]

[384]

U. Kazunori et al. Design of the Kernel Language for the Parallel Inference Machine. Computer J, December 1990. [ bib ]

[385]

J. J. Moreno-Navarro, H. Kuchen, R. Loogen, and M. Rodríguez-Artalejo. Lazy narrowing in a graph machine. In H. Kichner and W. Wechler, editors, 2nd International Conference on Algebraic and Logic Programming, Nancy (France), pages 298-317. CRIN (Centre de Recherche en Informatique de Nancy), LNCS, Springer Verlag, October 1990. [ bib | .ps.gz | Abstract ]

[386]

Stephen J. Garland, John V. Guttag, and James J. Horning. Debugging Larch Shared Language specifications. IEEE Transactions on Software Engineering, 16(9):1044-1075, September 1990. Reprinted as DEC Systems Research Center Report 60. Superseded by Chapter 7 in Guttag93. [ bib ]

[387]

A. Voronkov. Logic programming with bounded quantifiers. In A. Voronkov, editor, First Russian Conference on LP, volume 592, pages 486-514, Irkutsk, Rusia, September 1990. Springer 1992. [ bib ]

[388]

H. Kuchen, R. Loogen, J. J. Moreno-Navarro, and M. Rodríguez-Artalejo. Graph-based implementation of a functional logic language. In N. Jones, editor, Proceedings of the 3rd Symposium on Programming, volume 432, Berlin, 1990. Springer-Verlag. [ bib | .html | .ps.gz | Abstract ]

[389]

B. Stroustrup. The Programming Language C++. Addison Wesley, 1990. [ bib ]

[390]

William A. Josephson and James W. Armitage. Analysis tools for ada concurrency designs. In Proceedings of the seventh Washington Ada symposium on Ada, pages 189-204. ACM Press, 1990. [ bib | DOI ]

[391]

I. J. Hayes and C. B. Jones. Specifications are not (necessarily) executable. Technical Report 148, Key Center for Software Technology, Department of Computer Science, The University of Queensland, St. Lucia 4072. Australia, January 1990. [ bib | .ps.Z | .ps.Z | Abstract ]

[392]

J.T. Latham, V.J. Bush, and Cottam I.D. The Programming Process. An Introduction Using VDM and Pascal. Addison Wesley, 1st edition, 1990. [ bib ]

[393]

Carroll Morgan. Programming from Specifications. Prentice Hall International series in computer science. Prentice Hall International (UK) Ltd, 1990. [ bib ]

[394]

Anthony Hall. Seven myths of formal methods. IEEE Softw., 7(5):11-19, 1990. [ bib | DOI ]

[395]

Jeannette M. Wing. A specifier's introduction to formal methods. Computer, 23(9):8-23, 1990. [ bib | DOI ]

[396]

K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume 3, pages 493-574, Elsevier, New York, 1990. [ bib ]

[397]

R. Barbuti, D. Mancarella, D. Pedreschi, and F. Turini. A transformational approach to negation in logic programming. JLP, 8(3):201-228, 1990. [ bib ]

[398]

R. A. O'Keefe. The Craft of Prolog. The MIT Press, 1990. [ bib ]

[399]

L. Sterling, editor. The Practice of Prolog. The MIT Press, 1990. [ bib ]

[400]

Jan van Leeuwen, editor. Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics. Elsevier, 1990. [ bib ]

[401]

Laurence Puel and Ascánder Suárez. Compiling pattern matching by term decomposition. In Proceedings of the ACM Conference on Lisp and Functional Programming, 1990. [ bib ]

[402]

J.J. Moreno-Navarro, H. Kuchen, R. Loogen, and M. Rodríguez-Artalejo. Lazy narrowing in a graph machine. In H. Kirchner and W. Wechler, editors, 2nd International Conference on Algebraic and Logic Programming, ALP'90, Nancy (France), Lecture Notes in Computer Science, pages 298-317. CRIN (Centre de Recherche en Informatique de Nancy), Springer, october 1990. [ bib ]

[403]

Dan Sahlin. The Mixtus approach to the partial evaluation of full Prolog. In North American Conference on Logic Programming. The MIT Press, 1990. [ bib ]

[404]

Richard A. O'Keefe. The Craft of Prolog. The MIT Press, 1990. [ bib ]

[405]

Ian Foster and Stephen Taylor. Strand. New Concepts in Parallel Programming. Prentice Hall, 1990. [ bib ]

[406]

Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, MA, 1990. [ bib ]

[407]

Vijay A. Saraswat. Concurrent Constraint Programming. MIT Press, Cambridge, MA, 1990. [ bib ]

[408]

D.H.D. Warrenet al. S. Haridi, E. Lusk. The Aurora Or-Parallel Prolog System. New Generation Computing, 7:243-271, 1990. [ bib ]

[409]

R. Morales-Fernandez and J.J. Moreno-Navarro. CC-Modula: A Modula-2 Tool to Teach Concurrent Programming. ACM SIGCSE Bulletin, 21(3):19-25, September 1989. [ bib ]

[410]

G.R. Andrews and F.B. Schneider. Concepts and notations for concurrent programming. In Gehani and McGettrick [412]. [ bib ]

[411]

R. Smullyan. Juegos para imitar a un pájaro imitador. GEDISA, 1989. [ bib ]

[412]

N. Gehani and A.D. McGettrick, editors. Concurrent Programming. Addison-Wesley, 1989. [ bib ]

[413]

Douglas L. Long, Lori A. Clarke, and Joseph Fialli. Ada language considerations for concurrency analysis. In Proceedings of the sixth Washington Ada symposium on Ada, pages 75-80. ACM Press, 1989. [ bib | DOI ]

[414]

Leslie Lamport. A simple approach to specifying concurrent systems. Commun. ACM, 32(1):32-45, 1989. [ bib | DOI | .pdf ]

[415]

C.P.J. Koymans and G.R. Renardel de Lavalette. The logic MPL_ω. In Algebraic Methods: Theory, Tools and Applications (Part I), number 394 in Lecture Notes in Computer Science. Sprinter Verlag, 1989. [ bib ]

[416]

D. Chan. An extension of constructive negation and its application in coroutining. In Proc. NACLP'89, pages 477-493. The MIT Press, 1989. [ bib ]

[417]

Oscar Nierstrasz. Survey of object-oriented concepts. In W. Kimand and F. Lochovsky, editors, Object Oriented Concepts, Databases and Applications, pages 3-21. ACM Press and Addison-Wesley, 1989. [ bib | .ps.gz ]

[418]

J. Ferber. Computational reflection in class based object-oriented languages. In Conference Proceedings on Object Oriented Programming Systems Languages and Applications (OOPSLA'89), pages 317 - 326, New Orleans, Louisiana, United States, 1989. [ bib | Abstract ]

[419]

I. Sommerville. Software Engineering. Addison-Wesley, 3rd edition, 1989. [ bib ]

[420]

Peter H.J. Van Eijk, Chris A. Vissers, and Michel Diaz, editors. The Formal Description Technique Lotos: Results of the Esprit/Sedos Project. North-Holland, 1989. [ bib ]

[421]

Kei Davis and Philip Wadler. Backwards strictness analysis: Proved and improved. In Functional Programming, Glasgow Workshop, Workshops in Computer Science. British Computer Society, Springer Verlag, 1989. [ bib ]

[422]

Robin Milner. Communication and Concurrency. Prentice-Hall, 1989. [ bib ]

[423]

Barbara Liskov. Data abstraction and hierarchy. ACM SIGPLAN Notices, 25(5), May 1988. [ bib ]

[424]

Steve Johnson. Yacc meets C++. Computing systems (USA), 1(2):159, spring 1988. [ bib ]

[425]

D. Chan. Constructive negation based on the complete database. In Proc. Int. Conference on LP'88, pages 111-125. The MIT Press, 1988. [ bib ]

[426]

Pattie Maes. Issues in computational reflection. In P. Maes and D. Nardi, editors, Meta-Level Architectures and Reflection. Elsevier Publishers B.V. (North-Holland), 1988. [ bib ]

[427]

P. Cointe. The objvlisp kernel: A reflective lisp architecture to define a uniform object-oriented system. In P. Maes and D. Nardi, editors, Meta-Level Architectures and Reflection, pages 155-176. Elsevier Publishers B.V. (North-Holland), 1988. [ bib ]

[428]

Richard Bird and Philip Wadler. Introduction to Functional Programming. Prentice-Hall, 1988. [ bib ]

[429]

A. Laville. Implementation of lazy pattern matching algorithms. In Proceedings of the European Symposium on Programming, volume 300 of Lecture Notes in Computer Science. Springer, 1988. [ bib ]

[430]

Richard Bird and Philip Wadler. Introduction to Functional Programming. Prentice-Hall, 1988. [ bib ]

[431]

J. R. Rose. Implementing a compiler in C++: experience and generalizations. In USENIX Association C++ Workshop Proceedings, pages 135-146, Santa Fe NM, November 1987. Thinking Machines Corp, Cambridge MA, USENIX Assoc., Berkeley CA, USA. [ bib ]

[432]

P. Cointe. Metaclasses are first class: The objvlisp model. In Proceedings of the 2nd ACM Conference on Object-Oriented Programming Systems, Languages and Applications, pages 156-167, October 1987. [ bib ]

[433]

S.C. Dewhurst. The architecture of a C++ compiler. In USENIX Association C++ Workshop proceedings, pages 25-45, 11 1987. [ bib ]

[434]

A.S. Tanenbaum. Operating Systems: Design and Implementation. Prentice-Hall, 1987. [ bib ]

[435]

Jean H. Gallier. Logic for Computer Science. Foundations of Automatic Theorem Proving. John Willey and Sons, Inc., 1987. [ bib ]

[436]

R. Barbuti, D. Mancarella, D. Pedreschi, and F. Turini. Intensional negation of logic programs. Lecture notes on Computer Science, 250:96-110, 1987. [ bib ]

[437]

K. Kunen. Negation in logic programming. JLP, 4:289-308, 1987. [ bib ]

[438]

J. L. Lassez and K. Marriot. Explicit representation of terms defined by counter examples. Journal of Automated Reasoning, 3, 1987. [ bib ]

[439]

J. W. Lloyd. Foundations of Logic Programing, 2nd edition. Springer, 1987. [ bib ]

[440]

M. Carlsson. Freeze, indexing, and other implementation issues in the wam. In ICLP, pages 40-58. The MIT Press, 1987. [ bib ]

[441]

Pattie Maes. Concepts and Experiments in Computational Reflection. In Conference Proceedings on Object Oriented Programming Systems Languages and Applications (OOPSLA'89), 1987. [ bib ]

[442]

Pattie Maes. Computational reflection. Technical Report 87-2, Artificial Intelligence Laboratory, Vrije Universiteit Brussel, 1987. [ bib ]

[443]

William Clocksin and Christopher S.Mellish. Programming in Prolog. Springer Verlag, 1987. [ bib ]

[444]

Rita Loogen, Francisco Lopez Fraguas, and Mario Rodríguez Artalejo. A demand driven computation strategy for lazy narrowing. In Gilles Kahn, editor, Third International Conference on Functional Programming Languages and Computer Architecture, volume 274, pages 385-407, Portland, Oregon, USA, September 14-16, 1987. Springer. [ bib ]

[445]

S. Thatte. A refinement of strong sequentiality for term rewriting with constructors. Information and Computation, 72:46-65, 1987. [ bib ]

[446]

S. L. Peyton-Jones. The Implementation of Functional Programming Languages. Prentice-Hall, 1987. [ bib ]

[447]

Philip Wadler. Efficient compilation of pattern matching. In Peyton-Jones, editor, The Implementation of Functional Programming Languages, pages 78-103. Prentice-Hall, 1987. See [446]. [ bib ]

[448]

Philip Wadler. Strictness analysis on non-flat domains by abstract interpretation over finite domains. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, chapter 12. Ellis-Horwood, 1987. [ bib ]

[449]

William F. Clocksin and Christopher S. Mellish. Programming in Prolog. Springer, 1987. ISBN 0-387-17539-3. [ bib ]

[450]

Kazunori Ueda. Guarded Horn Clauses. PhD thesis, University of Tokyo, March 1986. [ bib ]

[451]

A. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1986. [ bib ]

[452]

Cliff B. Jones. Systematic Software Development Using VDM. Prentice Hall, 1986. [ bib ]

[453]

Cliff B. Jones. Systematic Software Development Using VDM. Prentice Hall, 1986. [ bib ]

[454]

Lee Naish. Negation and Control in Prolog, volume 238 of Lecture Notes in Computer Science. Springer-Verlag New York, Inc., 1986. [ bib ]

[455]

L. Naish. Negation and quantifiers in NU-Prolog. In Proc. 3rd ICLP, 1986. [ bib ]

[456]

L. Sterling and E. Y. Shapiro. The Art Of Prolog. MIT Press, 1986. [ bib ]

[457]

Daniel H. H. Ingalls. A simple technique for handling multiple polymorphism. SIGPLAN Notices, 21(11):347-349, 1986. [ bib ]

[458]

Leon Sterling and Ehud Shapiro. The Art of Prolog. The MIT Press, 1986. [ bib ]

[459]

K. L. Clark and S. Gregory. Parlog: Parallel programming in logic. ACM Transactions on Programming Languages and Systems (TOPLAS), 8(1):1-49, 1986. [ bib ]

[460]

Luca Cardelli and Peter Wegner. On understanding types, data abstraction and polymorphism. Computing Surveys, 17(4):471-522, December 1985. [ bib ]

[461]

Axel T. Schreiner and H. George Friedman. Introduction to compiler construction with UNIX. Prentice Hall, 1985. [ bib ]

[462]

C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985. [ bib ]

[463]

C. Mierowsky, S. Taylor, E. Shapiro, J. Levy, and J. Safra. The Design and Implemenation of Flat Concurrent Prolog. Technical Report TR.CS85-09, The Weizmann Institute, 1985. [ bib ]

[464]

Bernard H. Boar. Application Prototyping: A Requirements Definition Strategy for the '80s. John Wiley & Sons, 1984. ISBN: 047189317X. [ bib ]

[465]

Alain Colmerauer. Equations and inequations on finite and infinite trees. In International Conference on Fifth Generation Computer Systems, pages 85-99. ICOT, 1984. [ bib ]

[466]

R. Nasr L. Pereira. Delta Prolog: a Distributed Logic Programming Language. In International Conference on Fifth Generation Computer Systems, pages 283-291. ICOT, 1984. [ bib ]

[467]

Leslie Lamport. Specifying concurrent program modules. ACM Trans. Program. Lang. Syst., 5(2):190-222, 1983. [ bib | DOI | .pdf ]

[468]

H.B.M. Jonkers and J.H. Obbink. COLD: A common object-oriented language for design. Technical report, Philips Research Laboratories, Eindhoven, 1983. Working document. [ bib ]

[469]

A. Goldberg and D. Robson. Smalltalk-80: The Language and its Implementation. Addison-Wesley, 1983. [ bib ]

[470]

E.Y. Shapiro. Algorithmic Program Debugging. The MIT Press, 1982. [ bib ]

[471]

Alain Colmerauer. Prolog and infinite trees. In K.L. Clark and S.A. Tarnlund, editors, Logic Programming, number 16 in APIC Studies in Data Processing. Academic Press, 1982. [ bib ]

[472]

K. Gödel. Sobre proposiciones formalmente indecidibles de los principia mathematica y sistemas afines. Universidad de Valencia, 1980. [ bib ]

[473]

A. Mycroft. The theory and practice of transforming call-by-need into call-by-value. In Proc. International Symposium on Programming, volume 83 of Lecture Notes in Computer Science, pages 269-281. Springer, 1980. [ bib ]

[474]

J. W. Thatcher, E. G. Wagner, and J. B. Wright. More advice on structuring compilers and proving them correct. Lecture Notes in Computer Science, pages 596-615, 1979. [ bib ]

[475]

A. van Lamsweerde and M. Sintzoff. Formal derivation of strongly correct concurrent programs. Acta Informatica, 12, 1979. [ bib ]

[476]

G. Huet and J.J. Lévy. Call by need computations in non-ambiguous linear term rewriting systems. Technical Report Rapport Laboria 359, IRIA, august 1979. [ bib ]

[477]

K. L. Clark. Negation as failure. In J. Minker H. Gallaire, editor, Logic and Data Bases, pages 293-322, New York, NY, 1978. [ bib ]

[478]

Gérard Huet. Resolution d'équations dans les langages d'ordre 1, 2 ... Ω. PhD thesis, Université Paris VI, 1976. [ bib ]

[479]

S. C. Johnson. Yacc - yet another compiler compiler. Technical Report 32, Bell Telephone Laboratories, Murray Hill, NJ, 1975. [ bib ]

[480]

M. E. Lesk. Lex - a lexical analyzer generator. Technical Report 39, Bell Telephone Laboratories, Murray Hill, NJ, 1975. [ bib ]

[481]

Per Brinch Hansen. The programming language Concurrent Pascal. IEEE Software Engineering, SE-1(2):199-207, 1975. [ bib ]

[482]

C.A.R.Hoare. Monitors, an operating system structuring concept. Communications of the ACM, 17(10):549-557, October 1974. [ bib ]

[483]

R. Campbell and A. Habermann. The Specification of Process Synchronisation by Path Expressions. In Proceedings of International Symposium on Operating Systems, pages 89-102. Springer-Verlag, April 1974. [ bib ]

[484]

Donald E. Knuth. Semantics of context-free languages. Mathematical Systems Theory, 2(2):127-145, 1968. [ bib ]

[485]

Resource description framework (rdf). www.w3.org/RDF. [ bib | www: ]

[486]

Web service architecture. www.w3.org/TR/ws-arch/introduction. [ bib | www: ]

[487]

Noelia Maya. Una traducción del cálculo π a lenguajes lógico concurrentes. Trabajo de investigación de doctorado, dirigido por Julio Mariño. [ bib ]

[488]

The SLAM Project.
http://babel.ls.fi.upm.es/slam. [ bib | http ]

[489]

Xavier Leroy. LinuxThreads. Linux Manual Pages. [ bib ]

[490]

ACM/IEEE-CS Joint Curriculum Task Force. Computing Curricula 1991.
http://www.acm.org/education/curr91/. [ bib ]

[491]

The Joint Task Force on Computing Curricula IEEE-CS/ACM. Computing Curricula 2001.
http://www.computer.org/education/cc2001/. [ bib ]

[492]

Formal and precise software pattern representation languages faq. http://www.cs.concordia.ca/%7efaculty/eden/precise_and_formal/faq.htm. [ bib | http ]

[493]

The IFAD VDM website.
http://www.ifad.dk/vdm/vdm.htm. [ bib | http ]

[494]

A Z website.
http://www.comlab.ox.ac.uk/archive/z.html. [ bib | .html ]

[495]

A Larch website.
http://www.sds.lcs.mit.edu/Larch/. [ bib | .html ]

[496]

The TROLL website.
http://www.trolltech.com. [ bib | http ]

[497]

The Albert website.
http://www.info.fundp.ac.be/albert. [ bib | http ]

[498]

The Oblog website.
http://www.oblog.com. [ bib | http ]

[499]

The world wide web virtual library: Formal methods.
http://www.afm.sbu.ac.uk. [ bib | http ]

[500]

Rws: Storn surge barrier.
http://www.afm.sbu.ac.uk. [ bib | http ]

[501]

The Collection of Computer Science Bibliographies.
http://liinwww.ira.uka.de/bibliography/
LogicProgramming/index.html. [ bib ]

[502]

Refactoring home page.
http://www.refactoring.com/. [ bib | http ]

[503]

Walter Maner et al. Rapid application development.
http://csweb.cs.bgsu.edu/maner/domains/RAD.htm. [ bib | http ]

[504]

Walter Maner et al. Prototyping.
http://csweb.cs.bgsu.edu/maner/domains/Proto.htm. [ bib | http ]

[505]

Julio Mariño. Denotational abstract interpretation of functional logic programs. In preparation. Look under http://lml.ls.fi.upm.es/~labman/papers. [ bib ]

[506]

Mark P. Jones. Hugs 1.4 User's Manual. Available under http://www.haskell.org. [ bib ]

[507]

The Ciao home page at UPM. http://clip.dia.fi.upm.es/Software/Ciao/. [ bib ]

---

This file has been generated by bibtex2html 1.85.