Papers are classified by years:
2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994.


2012

SAT modulo linear arithmetic for Solving Polynomial Constraints
C. Borralleras, S. Lucas,, A. Oliveras, Enric Rodríguez-Carbonell, and A. Rubio
© Springer-Verlag
Journal of Automated Reasoning, 48(1):107-131, 2012.
Available: Abstract PDF (preprint)


2011

Proving Termination Properties with MU-TERM
B. Alarcón, R. Gutiérrez, S. Lucas, and R. Navarro-Marset
© Springer-Verlag
Proc. of the 13th International Conference on Algebraic Methodology And Software Technology, AMAST'10
LNCS 6486:201-208, 2011.
Available: Abstract PDF


2010

A Dependency Pair Framework for A∨C-Termination
B. Alarcón, S. Lucas, and J. Meseguer
© Springer-Verlag
Proc. of the 8th International Workshop on Rewriting Logic and its Applications, WRLA'10
LNCS 6381:36-52, 2010.
Available: Abstract PDF

Proving Termination in the Context-Sensitive Dependency Pair Framework
R. Gutiérrez and S. Lucas
© Springer-Verlag
Proc. of the 8th International Workshop on Rewriting Logic and its Applications, WRLA'10
LNCS 6381:19-35, Springer-Verlag, Berlin, 2010.
Available: Abstract PDF

Context-Sensitive Dependency Pairs
B. Alarcón, R. Gutiérrez and S. Lucas
© Elsevier
Information and Computation, 208(8):922-968, 2010.
Available: Abstract PDF (preprint) BibTeX entry

From matrix interpretations over the rationals to matrix interpretations over the naturals
S. Lucas
© Springer-Verlag
Proc. of the 10th International Conference on Artificial Intelligence and Symbolic Computation, AISC'10
LNAI 6167:116-131, 2010.
Available: Abstract PDF

On-Demand Strategy Annotations Revisited: An Improved On-Demand Evaluation Strategy
M. Alpuente, S. Escobar, B. Gramlich, and S. Lucas
© Elsevier
Theoretical Computer Science 411(2):504-541, 2010.
Available: Abstract PDF


2009

Automatic Proofs of Termination with Elementary Interpretations
S. Lucas
© Elsevier
Final Proceedings of the 9th Spanish Conference on Programming and Computer Languages, PROLE'09
Electronic Notes in Theoretical Computer Science 258(1):41-61, 2009.
Available: Abstract PDF

Termination Modulo Combinations of Equational Theories
F. Durán, S. Lucas, and J. Meseguer
© Springer-Verlag
Proc. of the 7th International Symposium on Frontiers of Combining Systems, FroCoS'09
LNAI 5749:246-262, Springer-Verlag, Berlin, 2009.
Available: Abstract PDF

Using Matrix Interpretations over the Reals in Proofs of Termination
B. Alarcón, S. Lucas, and R. Navarro-Marset
Proceedings of the 9th Spanish Conference on Programming and Computer Languages, PROLE'09
pages 255-264, ISBN 978-84-692-4600-9, 2009.
Available: Abstract PDF

Mechanizing Proofs of Termination in the Context-Sensitive Dependency Pairs Framework
R. Gutiérrez and S. Lucas
Proc. of the Ninth Spanish Conference on Programming and Computer Languages, PROLE 2009
pages 265-274, ISBN 978-84-692-4600-9, 2009.
Available: Abstract PDF

Solving non-linear polynomial arithmetic via SAT modulo linear arithmetic
C. Borralleras, S. Lucas,, R. Navarro-Marset, Enric Rodríguez-Carbonell, and A. Rubio
© Springer-Verlag
Proc. of the 22nd International Conference on Automated Deduction, CADE'09
LNAI 5663:294-305, Springer-Verlag, Berlin, 2009.
Available: Abstract PDF

Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
B. Alarcón, S. Lucas
© Elsevier
Selected papers of the 8th Spanish Conference on Programming and Computer Languages, PROLE'08
Electronic Notes in Theoretical Computer Science, 248:3-17, 2009.
Available: Abstract PDF

Methods for proving termination of rewriting-based programming languages
F. Durán, S. Lucas, and J. Meseguer
© Elsevier
Selected papers of the 8th Spanish Conference on Programming and Computer Languages, PROLE'08
Electronic Notes in Theoretical Computer Science, 248 :93-113, 2009.
Available: Abstract PDF

Web Services and Interoperability for the Maude Termination Tool
F. Durán, S. Lucas, and J. Meseguer
© Elsevier
Selected papers of the 8th Spanish Conference on Programming and Computer Languages, PROLE'08
Electronic Notes in Theoretical Computer Science, 248 :83-92, 2009.
Available: Abstract PDF

Operational Termination of Membership Equational Programs: the Order-Sorted Way
S. Lucas and J. Meseguer
© Elsevier
Proc. of the 7th International Workshop on Rewriting Logic and its Applications, WRLA'08
Electronic Notes in Theoretical Computer Science, 238(3):207-225, 2009.
Available: Abstract PDF


2008

Improving Context-Sensitive Dependency Pairs
B. Alarcón, F. Emmes, C. Fuhs, J. Giesl, R. Gutiérrez, S. Lucas, P. Schneider-Kamp, and R. Thiemann
© Springer-Verlag
Proc. of the 15th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, LPAR'08
LNAI 5330:636-651, Springer-Verlag, Berlin, 2008.
Available: Abstract

MTT: The Maude Termination Tool
F. Durán, S. Lucas, and J. Meseguer
© Springer-Verlag
Proc. of the 4th International Joint Conference on Automated Reasoning, IJCAR'08
LNCS 5195:313-319, Springer-Verlag, Berlin, 2008.
Available: Abstract PDF

Search Techniques for Rational Polynomial Orders
C. Fuhs, R. Navarro-Marset, C. Otto, J. Giesl, S. Lucas, and P. Schneider-Kamp
© Springer-Verlag
Proc. of the 9th International Conference on Artificial Intelligence and Symbolic Computation, AISC'08
LNAI 5144:109-124, Springer-Verlag, Berlin, 2008.
Available: Abstract PDF

Rewriting Techniques for Analysing Termination and Complexity Bounds of Safe Programs
S. Lucas and R. Peña
Proc. of 18th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2008
Technical Report DSIC-II/09/08, pages 43-57, 2008.
Available: Abstract PDF

Usable Rules for Context-Sensitive Rewrite Systems
R. Gutiérrez, S. Lucas, and X. Urbain
© Springer-Verlag
Proc. of the 19th International Conference on Rewriting Techniques and Applications, RTA'08
LNCS 5117:126-141, Springer-Verlag, Berlin, 2008.
Available: Abstract PDF

Order-Sorted Dependency Pairs
S. Lucas and J. Meseguer
© ACM
Proc. of the 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, PPDP'08
ACM Press, pages 108-119, 2008.
Available: Abstract PDF

Proving Operational Termination of Membership Equational Programs
F. Durán, S. Lucas, C. Marché, J. Meseguer, and X. Urbain
© Springer-Verlag
Higher-Order and Symbolic Computation, 21(1-2):59-88, June 2008.
Available: Abstract PDF (preprint) DOI

Formal Verification of Web Sites
S. Flores, S. Lucas and A. Villanueva
© Elsevier
Proc. of the 3rd Int'l Workshop on Automated Specification and Verification of Web Systems WWV'07
Electronic Notes in Theoretical Computer Science, 200(3) :103-118, May 2008.
Available: Abstract PDF

Termination of Just/Fair Computations in Term Rewriting
S. Lucas and J. Meseguer
© Elsevier
Information and Computation 206(5):652-675, May 2008.
Available: Abstract PDF (preprint)

Comparing CSP and SAT solvers for polynomial constraints in termination provers
S. Lucas and R. Navarro-Marset
© Elsevier
Proc. of 7th Spanish Conference on Programming and Computer Languages, PROLE 2007, selected papers
Electronic Notes in Theoretical Computer Science, 206:75-90, April 2008.
Available: Abstract PDF


2007

Termination and complexity bounds for SAFE programs
S. Lucas and R. Peña
© Thomson-Paraninfo
Proc. of 7th Spanish Conference on Programming and Computer Languages, PROLE 2007
pages 233-242, Thomson-Paraninfo, Madrid, 2007.
Available: Abstract PDF

Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
B. Alarcón and S. Lucas
© Springer-Verlag
Proc. of the 6th International Symposium on Frontiers of Combining Systems, FroCoS'07
LNCS 4720:73-87, Springer-Verlag, Berlin, 2007.
Available: Abstract PDF

The Maude Formal Tool Environment
M. Clavel, F. Durán, J. Hendrix, S. Lucas, J. Meseguer, and P. Olveczky
© Springer-Verlag
Proc. of CALCO tools 2007,
LNCS 4624:173-178, Springer-Verlag, Berlin, 2007.
Available: Abstract PDF

Practical use of polynomials over the reals in proofs of termination
S. Lucas
© ACM Press
Proc. of 9th International Conference on Principles and Practice of Declarative Programming, PPDP'07,
pages 39-50, ACM Press, 2007.
Available: Abstract PDF

Improving the context-sensitive dependency graph
B. Alarcón, R. Gutiérrez, S. Lucas
© Elsevier
Electronic Notes in Theoretical Computer Science, 188:91-103, 2007.
Available: Abstract PDF

Proving Termination of Context-Sensitive Rewriting With MU-TERM
B. Alarcón, R. Gutiérrez, J. Iborra, and S. Lucas
© Elsevier
Electronic Notes in Theoretical Computer Science, 188:105-115, 2007.
Available: Abstract PDF

Removing Redundant Arguments Automatically
M. Alpuente, S. Escobar, S. Lucas
© Cambridge University Press
Theory and Practice of Logic Programming, 7(1&2):3-35, 2007.
Available: Abstract

2006

Context-Sensitive Dependency Pairs
B. Alarcón, R. Gutiérrez, and S. Lucas
© Springer-Verlag
Proc. of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'06
LNCS 4337:298-309, Springer-Verlag, Berlin, 2006.
Available: Abstract PDF

Proving Termination of Context-Sensitive Rewriting by Transformation
S. Lucas
© Elsevier
Information and Computation, 204(12):1782-1846, 2006.
Available: Abstract PDF (preprint)

Generalizing Newman's Lemma for Left-Linear Rewrite Systems
B. Gramlich and S. Lucas
© Springer-Verlag
Proc. of 17th International Conference on Rewriting Techniques and Applications, RTA'06,
LNCS 4098:66-80, Springer-Verlag, Berlin, 2006.
Available: Abstract PDF

Building .NET GUIs for Haskell applications
B. Alarcón and S. Lucas
4th International Conference on .NET Technologies,
University of West-Bohemia, pages 57-66, 2006
Available: Abstract PDF

Rewriting-Based Navigation of Web Sites: Looking for Models and Logics
S. Lucas
© Elsevier
Electronic Notes in Theoretical Computer Science, 157(2):79-85, May 2006.
Available: Abstract PDF

On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
© Springer-Verlag
S. Lucas
Applicable Algebra in Engineering, Communication and Computing, 17(1):49-73, April 2006.
Available: Abstract PDF (preprint)

2005

Termination of Fair Computations in Term Rewriting
© Springer-Verlag
S. Lucas and J. Meseguer
12th International Conference on Logic for Programming, Artificial intelligence and Reasoning, LPAR'05,
LNCS 3835:184-198, Springer-Verlag, Berlin, 2005.
Available: Abstract PDF

Crossing the Rubicon: from Haskell to .NET through COM
B. Alarcón and S. Lucas
ERCIM News 63:51-52, October 2005
Available: ERCIM News, issue 63 (PDF) HTML.

A Note on Syntactic Annotations for Narrowing
© Thomson
M. Alpuente, S. Escobar, S. Lucas
Proc. of Quintas Jornadas sobre Programación y Lenguajes, PROLE'05, pages 25-30, Thomson-Paraninfo, 2005.
Available: Abstract

Report on the use of polynomials with real and rational coefficients in proofs of termination
© Thomson
S. Lucas
Proc. of Quintas Jornadas sobre Programación y Lenguajes, PROLE'05, pages 105-108, Thomson-Paraninfo, 2005.
Available: Abstract

Fourth Spanish Conference on Programming and Computer Languages, PROLE 2004 - Selected papers
© Elsevier
S. Lucas (editor),
Electronic Notes in Theoretical Computer Science, volume 137, issue 1, July 2005.
Available:

Operational termination of conditional term rewriting systems
© Elsevier
S. Lucas, C. Marché, and J. Meseguer
Information Processing Letters, 95(4):446-453, August 2005.
Available: Abstract PDF (preprint)

Polynomials over the reals in proofs of termination: from theory to practice
S. Lucas
© EDP Sciences
RAIRO Theoretical Informatics and Applications, 39(3):547-586, July 2005.
Available: Abstract PDF

Reduction Strategies in Rewriting and Programming (special issue)
B. Gramlich and S. Lucas (editors)
© Elsevier
Journal of Symbolic Computation volume 40, issue 1, Elsevier, May 2005.
Available: Summary

Specialization of Functional Logic Programs Based on Needed Narrowing
M. Alpuente, M. Hanus, S. Lucas, G. Vidal
© Cambridge University Press
Theory and Practice of Logic Programming, 5(3):273-303, May 2005.
Available: Abstract Online article (with proofs) BibTeX entry

A note on completeness of conditional context-sensitive rewriting
S. Lucas
Proc. of 5th International Workshop on Reduction Strategies in Rewriting and Programming, WRS'05,
pages 3-15, 2005.
Available: Abstract PDF

Strategies in Programming Languages Today
S. Lucas
© Elsevier
Electronic Notes in Theoretical Computer Science, 124(2) :113-118, 2005.
Available: Abstract PDF

Connecting Remote Tools: Do it by yourSELF!
M. Alpuente and S. Lucas
ERCIM News 61:48-49, April 2005
Available: ERCIM News, issue 61 (PDF) HTML.

Rewriting-based Navigation of Web Sites
S. Lucas
Proc. of 1st International Workshop on Automated Specification and Verification of Web Sites, WWV'05,
Technical Report DSIC-II/03/05, DSIC, Universidad Politécnica de Valencia, pages 157-160, 2005.
Available: Abstract PDF

On-demand evaluation for Maude
F. Durán, S. Escobar, and S. Lucas
© Elsevier
Electronic Notes in Theoretical Computer Science, 124(1) :25-39, 2005.
Available: Abstract PDF

New evaluation commands for Maude within Full Maude
F. Durán, S. Escobar, and S. Lucas
© Elsevier
Electronic Notes in Theoretical Computer Science, 117 :263-284, 2005.
Available: Abstract PDF

2004

Proving Termination of Context-Sensitive Rewriting by Transformation
S. Lucas
Technical Report DSIC II/18/04 (60 pages).
Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Spain, December 2004.
Available: Abstract PDF

Proc. of the IV Jornadas sobre Programación y Lenguajes, PROLE'04
S. Lucas, E. Pimentel, M.M. Gallardo (editors),
Universidad de Málaga, November 2004.
Available: Proceedings

Towards (constructor) normal forms for Maude within full Maude
F. Durán, S. Escobar, S. Lucas,
Proc. of IV Jornadas sobre Programación y Lenguajes, PROLE'04,
pages 125-136, Universidad de Málaga, 2004.
Available: Abstract PDF

Proving Termination of Membership Equational Programs
F. Durán, S. Lucas, J. Meseguer, C. Marché, and X. Urbain
© ACM Press
Proc. of ACM SIGPLAN 2004 Symposium on Partial Evaluation and Program Manipulation, PEPM'04,
pages 147-158, ACM Press, 2004.
Available: Abstract PDF

MU-TERM: A Tool for Proving Termination of Context-Sensitive Rewriting
S. Lucas
© Springer-Verlag
Proc. of 15th International Conference on Rewriting Techniques and Applications, RTA'04,
LNCS 3091:200-209, Springer-Verlag, Berlin, 2004.
Available: Abstract PDF PostScript

Connecting remote termination tools
M. Alpuente and S. Lucas
Proc. of 7th International Workshop on Termination, WST'04,
pages 6-9, Technical Report AIB-2004-07, RWTH Aachen, 2004.
Available: Abstract PDF

MU-TERM: a tool for proving termination of rewriting with replacement restrictions
S. Lucas
Proc. of 7th International Workshop on Termination, WST'04,
pages 63-65, Technical Report AIB-2004-07, RWTH Aachen, 2004.
Available: Abstract PDF

Polynomials over the reals in proofs of termination
S. Lucas
Proc. of 7th International Workshop on Termination, WST'04,
pages 39-42, Technical Report AIB-2004-07, RWTH Aachen, 2004.
Available: Abstract PDF

Correct and complete (positive) strategy annotations for OBJ
M. Alpuente, S. Escobar, S. Lucas
© Elsevier
Proc. of 4th International Workshop on Rewriting Logic and its Applications, WRLA'02,
Electronic Notes in Theoretical Computer Science, volume 71, May 2004.
Available: Abstract PDF PostScript .

Polynomials for Proving Termination of Context-Sensitive Rewriting
S. Lucas
© Springer-Verlag
Proc. of 7th International Conference on Foundations of Software Science and Computation Structures, FOSSACS'04,
LNCS 2987:318-332, 2004.
Available: Abstract PDF PostScript BibTeX entry

Modular Context-Sensitive Algebraic Specifications
B. Gramlich and S. Lucas
Proc. of 17th Int. Workshop on Algebraic Development Techniques WADT'04, pages 20-22, 2004.
Available: Abstract PDF PostScript BibTeX entry

New evaluation commands for Maude within Full Maude
F. Durán, S. Escobar, and S. Lucas
Proc. of 5th International Workshop on Rewriting Logic and its Applications, WRLA'04, pages 245-265, 2004.
Available: Abstract PDF BibTeX entry

Strong and NV-sequentiality of constructor systems
S. Lucas
© Elsevier
Information Processing Letters 89(4):191-201, 2004.
Available: Abstract PDF (preliminary version) PostScript (preliminary version) BibTeX entry


2003

Reduction Strategies in Rewriting and Programming
B. Gramlich and S. Lucas (editors)
Third International Workshop, WRS'03 - Final proceedings, Valencia, Spain, June 8, 2003
Electronic Notes in Theoretical Computer Science, volume 86, Issue 4, December 2003.
Available: ENTCS vol. 86

RDP 2003 - Federated Conference on Rewriting, Deduction and Programming
S. Lucas
ERCIM News 55:45, October 2003
Available: ERCIM News, issue 55 (PDF) HTML.

Termination of programs with strategy annotations
S. Lucas
Technical Report DSIC II/20/03, 47 pages.
Departamento de Sistemas Informáticos y Computación, UPV, September 2003.
Available: Abstract PDF PostScript BibTeX entry.

On-Demand Evaluation by Program Transformation
M. Alpuente, S. Escobar, and S. Lucas
Proc. of 4th International Workshop on Rule-based Programming, RULE'03,
Electronic Notes in Theoretical Computer Science, volume 86.2, September 2003.
Available: Abstract PDF BibTeX entry.

OnDemandOBJ: A Laboratory for Strategy Annotations
M. Alpuente, S. Escobar, and S. Lucas
Proc. of 4th International Workshop on Rule-based Programming, RULE'03,
Electronic Notes in Theoretical Computer Science, volume 86.2, September 2003.
Available: Abstract PDF BibTeX entry.

On-demand Strategy Annotations Revisited
M. Alpuente, S. Escobar, B. Gramlich, and S. Lucas
Technical Report DSIC II/18/03,
Universidad Politécnica de Valencia, Spain, July 2003.
Available: Abstract PDF BibTeX entry.

Termination of Computational Restrictions of Rewriting and Termination of Programs
S. Lucas
Extended Abstracts of 6th International Workshop on Termination, WST'03,
Technical Report DSIC II/15/03, Universidad Politécnica de Valencia, pages 44-48, 2003.
Available: PDF PostScript BibTeX entry.

Automated Correction of Functional Programs
M. Alpuente, D. Ballis, S. Escobar, M. Falaschi, and S. Lucas
Proc. of the 12th International Workshop on Functional and (Constraint) Logic Programming WFLP'03,
Technical Report DSIC II/13/03, Universidad Politécnica de Valencia, pages 7-20, 2003.
Available:

Reduction Strategies in Rewriting and Programming
B. Gramlich and S. Lucas (editors)
Third International Workshop, WRS'03, Technical Report DSIC II/14/03, Universidad Politécnica de Valencia, Spain, June 8, 2003
Available: WRS'03 proceedings

Abstract Diagnosis of Functional Programs
M. Alpuente, M. Comini, S. Escobar, M. Falaschi, and S. Lucas
© Springer-Verlag
Selected papers of the International Workshop on Logic Based Program Development and Transformation, LOPSTR'02,
LNCS 2664:1-16, 2003.
Available: Abstract PDF PostScript BibTeX entry.

Semantics of programs with strategy annotations
S. Lucas
Technical Report DSIC II/8/03, 41 pages.
Departamento de Sistemas Informáticos y Computación, UPV, April 2003.
Available: Abstract PDF PostScript


2002

Reduction Strategies in Rewriting and Programming
B. Gramlich and S. Lucas (editors)
Second International Workshop, WRS'02 - Final proceedings, Copenhagen, Danemark, July 25, 2002
Electronic Notes in Theoretical Computer Science, volume 70, Issue 6, December 2002.
Available: ENTCS vol. 70

Redundancy of Arguments Reduced to Induction
M. Alpuente, R. Echahed, S. Escobar, S. Lucas
© Elsevier
Proc. of 11th International Workshop on Functional and (Constraint) Logic Programming WFLP'02 (selected papers),
Electronic Notes in Theoretical Computer Science, volume 76, 2002.
Available: Abstract PDF PostScript BibTeX entry.

Demandness in Rewriting and Narrowing
S. Antoy, S. Lucas
© Elsevier
Proc. of 11th International Workshop on Functional and (Constraint) Logic Programming WFLP'02 (selected papers),
Electronic Notes in Theoretical Computer Science, volume 76, 2002.
Available: Abstract PDF PostScript BibTeX entry.

Context-Sensitive Rewriting Strategies
S. Lucas
© Academic Press
Information and Computation, 178(1):294-343, 2002.
Available: Abstract PDF (preprint) PostScript (preprint) BibTeX entry

Improving On-demand Strategy Annotations
M. Alpuente, S. Escobar, B. Gramlich, and S. Lucas
© Springer-Verlag
Proc. of 9th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR'02,
LNAI 2514:1-18, Springer-Verlag, Berlin, 2002.
Available: Abstract PDF PostScript BibTeX entry.

A transformation for implementing on-demand strategy annotations
M. Alpuente, S. Escobar, and S. Lucas
Proc. of 3rd International Workshop on the Implementation of Logics.
pages 47-52, Tbilisi, Georgia, October 2002.
Available: Abstract

Modular Termination of Context-Sensitive Rewriting
B. Gramlich and S. Lucas
© ACM Press
Proc. of 4th International Conference on Principles and Practice of Declarative Programming, PPDP'02,
pages 50-61, ACM Press 2002.
Available: Abstract PDF PostScript Slides BibTeX entry.

Simple Termination of Context-Sensitive Rewriting
B. Gramlich and S. Lucas
© ACM Press
Proc. of 3rd ACM Sigplan Workshop on Rule-based Programming, RULE'02,
pages 29-41, ACM Press, 2002.
Available: Abstract PDF PostScript Slides BibTeX entry.

Lazy Rewriting and Context-Sensitive Rewriting
S. Lucas
© Elsevier
International Workshop on Functional and (Constraint) Logic Programming, WFLP 2001 (selected papers)
Electronic Notes in Theoretical Computer Science, volume 64, 2002.
Available: Abstract PDF PostScript BibTeX entry.

A Debugging Scheme for Functional Programs
M. Alpuente, M. Comini, S. Escobar, M. Falaschi, and S. Lucas
Preproceedings of the International Workshop on Logic Based Program Development and Transformation, LOPSTR'02,
pages 1-9, Servicio de Publicaciones de la Facultad de Informática de Madrid, 2002.
Available: Abstract PDF PostScript BibTeX entry.

A program transformation for implementing on-demand strategy annotations
M. Alpuente, S. Escobar, and S. Lucas
Proc. of 14th International Workshop on the Implementation of Functional Languages, IFL'02,
pages 409-424, Technical Report 127-02, Departamento de Sistemas Informáticos y Programación, Universidad Complutense de Madrid, 2002.
Available: Abstract PDF PostScript BibTeX entry.

Removing Redundant Arguments of Functions
M. Alpuente, S. Escobar, S. Lucas
© Springer-Verlag
Proc. of 9th International Conference on Algebraic Methodology And Software Technology, AMAST'02,
LNCS 2422:117-131, Springer-Verlag, Berlin, 2002.
Available: Abstract PDF PostScript BibTeX entry.

Recursive Path Orderings can be Context-Sensitive
C. Borralleras, S. Lucas, and A. Rubio
© Springer-Verlag
Proc. of 18th International Conference on Automated Deduction, CADE'02,
LNAI 2392:314-331, Springer-Verlag, Berlin, 2002.
Available: Abstract PDF PostScript BibTeX entry.

Termination of (Canonical) Context-Sensitive Rewriting
S. Lucas
© Springer-Verlag
Proc. of 13th International Conference on Rewriting Techniques and Applications, RTA'02,
LNCS 2378:296-310, Springer-Verlag, Berlin, 2002.
Available: Abstract PostScript BibTe entry Slides

Reduction Strategies in Rewriting and Programming
B. Gramlich and S. Lucas (editors)
Proc. of the Second International Workshop, WRS 2002, Copenhagen, Denmark, July 21, 2002
Technical Report E1852-2002-02, Institut of Computer Languages, Vienna University of Technology, Verlag Berger, July 2002.
Available:

Correct and complete (positive) strategy annotations for OBJ
M. Alpuente, S. Escobar, S. Lucas
Technical Report DSIC II/9/02, 19 pages.
Departamento de Sistemas Informáticos y Computación, UPV, June 2002.
Available: Abstract PDF PostScript BibTeX entry.

MU-TERM 1.0. User's manual
S. Lucas
Technical Report DSIC-II/1/02, 17 pages,
Departamento de Sistemas Informáticos y Computación, UPV, 2002.
Available: PostScript


2001

Reduction Strategies in Rewriting and Programming
B. Gramlich and S. Lucas (editors)
Selected papers of the First International Workshop, WRS'01, Utrecht, The Netherlands, May 26, 2001
Electronic Notes in Theoretical Computer Science, volume 57, November 2001.
Available: ENTCS vol. 57

Termination of Rewriting With Strategy Annotations
S. Lucas
© Springer-Verlag
Proc. of 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR'01
LNAI 2250:666-680, Springer-Verlag, Berlin, 2001.
Available: Abstract PostScript BibTeX entry.

Computational properties of term rewriting with strategy annotations
S. Lucas
Proc. of Primeras Jornadas sobre Programación y Lenguajes, PROLE'01
Universidad de Castilla-La Mancha, 2001.
Available: Abstract PostScript BibTeX entry.

Context-Sensitive Rewriting, Lazy Rewriting, and On-demand Rewriting
S. Lucas
Proc. of International Workshop on Functional and (Constraint) Logic Programming, WFLP'01,
pages 197-210, Report No. 2017, Christian-Albrechts-Universitaet zu Kiel, 2001.
Available: Abstract PostScript BibTeX entry.

Termination of on-demand rewriting and termination of OBJ programs
S. Lucas
© ACM Press
Proc. of 3rd International Conference on Principles and Practice of Declarative Programming, PPDP'01,
pages 82-93, ACM Press, 2001.
Available: Abstract PostScript BibTeX entry.

On proving termination of OBJ programs with positive local strategies
S. Lucas
Proc. of 2nd International Workshop on Rule-Based Programming, RULE'01,
pages 64-78, 2001.
Available: Abstract PostScript BibTeX entry.

An Evaluation Semantics for Narrowing-Based Functional Logic Languages
M. Hanus, S. Lucas
Journal of Functional and Logic Programming, 2001(2):1-43, July 2001.
Available: Abstract PostScript PDF BibTeX entry.

Reduction Strategies in Rewriting and Programming
B. Gramlich and S. Lucas (editors)
Proc. of the First International Workshop, WRS'01, Utrecht, The Netherlands, May 26, 2001
SPUPV 2001.2359, Universidad Politécnica de Valencia, 2001.
Available: Cover Preface Contents Electronic Proceedings.

Transfinite Rewriting Semantics for Term Rewriting Systems
S. Lucas
© Springer-Verlag
Proc. of 12th International Conference on Rewriting Techniques and Applications, RTA'01,
LNCS 2051:216-230, Springer-Verlag, Berlin, 2001.
Available: Abstract PostScript BibTeX entry.

Relating termination and infinitary normalization
S. Lucas
Extended Abstracts of 5th International Workshop on Termination, WST'01,
Logic Group Preprint Series 209:31-32, 2001.
Available: PostScript BibTeX entry.

On proving termination of OBJ programs
S. Lucas
Extended Abstracts of 5th International Workshop on Termination, WST'01,
Logic Group Preprint Series 209:29-30, 2001.
Available: PostScript BibTeX entry.


2000


Redundancy Analyses in Term Rewriting (extended abstract)
M. Alpuente, S. Escobar, and S. Lucas
9th International Workshop on Functional and Logic Programming, WFLP'2000,
pages 309-323, Universidad Politécnica de Valencia, Editorial U.P.V., Ref 2000-2039, 2000.
Available: PostScript

Redundant Arguments in Infinitary Rewriting (extended abstract)
S. Lucas
9th International Workshop on Functional and Logic Programming, WFLP'2000,
pages 340-343, Universidad Politécnica de Valencia, Editorial U.P.V., Ref 2000-2039, 2000.
Available: PostScript

Strong and NV-sequentiality of constructor systems (extended abstract)
S. Lucas
9th International Workshop on Functional and Logic Programming, WFLP'2000,
pages 253-267, Universidad Politécnica de Valencia, Editorial U.P.V., Ref 2000-2039, 2000.
Available: PostScript

Context-sensitive rewriting strategies
S. Lucas
Technical Report DSIC-II/7/00, 56 pages,
Departamento de Sistemas Informáticos y Computación, UPV, 2000.
Available: Abstract PostScript BibTeX entry

Observable Semantics and Dynamic Analysis of Computational Processes
S. Lucas
Technical Report LIX/RR/00/02, 24 pages,
Laboratoire d'Informatique (LIX), École Polytechnique, Palaiseau, France, 2000.
Available: Abstract PostScript BibTeX entry

An Evaluation Semantics for Narrowing-Based Functional Logic Languages
M. Hanus, S. Lucas
Technical Report 2000, 32 pages,
Christian Albrecht Universitat Kiel, 2000.
Available: Abstract PostScript BibTeX entry.


1999


UPV-Curry: an Incremental Curry Interpreter
M. Alpuente, S. Escobar, S. Lucas
© Springer-Verlag
26th. Seminar on Current Trends in Theory and Practice of Informatics, SOFSEM'99,
LNCS 1725:331-339, Springer-Verlag, Berlin, 1999.
Available: Abstract PostScript BibTeX entry.

A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages
M. Hanus, S. Lucas
© Springer-Verlag
4th Fuji International Symposium on Functional and Logic Programming, FLOPS'99,
LNCS 1722:353-368, Springer-Verlag, Berlin, 1999.
Available: Extended version in [TR'2000], [JFLP2001].

Specialization of Inductively Sequential Functional Logic Programs
M. Alpuente, M. Hanus, S. Lucas, G. Vidal
ACM Sigplan Notices, 34(9):273-283, 1999.
Available: Abstract PostScript BibTeX entry

Incremental Needed Narrowing
M. Alpuente, S. Escobar, S. Lucas
International Workshop on Implementation of Declarative Languages, IDL'99,
pages 109-125, INRIA, France, 1999.
Available: Abstract PostScript HTML BibTeX entry.

Rewriting with replacement restrictions (abstract of the PhD thesis)
S. Lucas
Bulletin of the European Association for Theoretical Computer Science, 67:274-277, 1999.
Available: Paper BibTeX entry

A framework for the analysis of syntactic replacement restrictions
S. Lucas
Technical Report DSIC-II/5/99, 42 pages, 1999. (short version in [AGP'97].)
Available: Abstract PostScript BibTeX entry


1998


Rewriting with replacement restrictions
S. Lucas
Ph.D. Thesis (In spanish).
Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Oct 1998.
Available: Abstract PostScript BibTeX entry

Root-neededness and approximations of neededness
S. Lucas
Information Processing Letters, 67(5):245-254, 1998.
Available: Abstract PostScript (preliminary version) BibTeX entry

Strongly sequential and inductively sequential term rewriting systems
M. Hanus, S. Lucas, A. Middeldorp
Information Processing Letters, 67(1):1-8, 1998.
Available: Abstract PostScript (preliminary version) BibTeX entry

Context-sensitive computations in functional and functional logic programs
S. Lucas
Journal of Functional and Logic Programming, 1998(1):1-61, January 1998.
Available: Abstract Paper BibTeX entry


1997


Efficient Strong Sequentiality Using Replacement Restrictions
S. Lucas
24th. Seminar on Current Trends in Theory and Practice of Informatics, SOFSEM'97,
LNCS 1338:489-496, Springer-Verlag, Berlin, 1997.
Available: Abstract PostScript BibTeX entry.

Needed Reductions with Context-Sensitive Rewriting
S. Lucas
6th International Conference on Algebraic and Logic Programming, ALP'97,
LNCS 1298:129-143, Springer-Verlag, Berlin, 1997.
Available: Abstract PostScript BibTeX entry.

Transformations for Efficient Evaluations in Functional Programming
S. Lucas
9th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP'97,
LNCS 1292:127-141, Springer-Verlag, Berlin, 1997.
Available: Abstract PostScript BibTeX entry.

Computational properties of term rewriting with replacement restrictions
S. Lucas
1997 Joint Conference on Declarative Programming, APPIA-GULP-PRODE'97,
pag. 393-404, Università di Udine, 1997
Available: Extended version in [TR'99]


1996


A New Proposal of Concurrent Process Calculus
S. Lucas and J. Oliver
23rd. Seminar on Current Trends in Theory and Practice of Informatics, SOFSEM'96,
LNCS 1175:385-392, Springer-Verlag, Berlin, 1996.
Available: Abstract PostScript BibTeX entry.

Using replacement restrictions in functional-logic languages
S. Lucas
5th Compulog-Network Area Meeting on Language Design and Semantic Analysis Methods
Università degli Studi, Pisa, 1996
Available: See [JFLP'98].

Context-sensitive Computations in Confluent Programs
S. Lucas
8th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP'96,
LNCS 1140:408-422, Springer-Verlag, Berlin, 1996. (See an extended and revised version in [JFLP'98].)
Available: Abstract PostScript BibTeX entry.

A Denotational Semantics for Needed Narrowing
M. Hanus and S. Lucas
1996 Joint Conference on Declarative Programming, APPIA-GULP-PRODE'96,
pag. 259-270, Universidad del País Vasco, 1996
Available: Abstract BibTeX-Entry

Termination of Context-Sensitive Rewriting by Rewriting
S. Lucas
23rd International Colloquium on Automata, Languages and Programming, ICALP'96,
LNCS 1099:122-133, Springer-Verlag, Berlin, 1996.
Available: Abstract PostScript BibTeX entry.

Towards a denotational semantics for needed narrowing
M. Hanus and S. Lucas
5th International Workshop on Functional and Logic Programming,
pag. VII.1-VII.11, Philipps-Universitat Marburg, 1996


1995


Fundamentals of context-sensitive rewriting
S. Lucas
22nd. Seminar on Current Trends in Theory and Practice of Informatics, SOFSEM'95,
LNCS 1012:405-412, Springer-Verlag, Berlin, 1995.
Available: Abstract PostScript BibTeX entry.

Computational properties of context-sensitive rewriting
S. Lucas
1995 Joint Conference on Declarative Programming, GULP-PRODE'95,
pag. 435-446, Università di Salerno, 1995.


1994


El Lambda Calculo Etiquetado Paralelo (LCEP)
S. Lucas and J. Oliver
1994 Joint Conference on Declarative Programming, GULP-PRODE'94,
pag. 125-139, Universidad Politécnica de Valencia, 1994.
Available: Abstract PostScript BibTeX entry.


S. Lucas