Folgen
Salvador Lucas
Titel
Zitiert von
Zitiert von
Jahr
Context-sensitive computations in functional and functional logic programs
S Lucas
Journal of Functional and Logic Programming 1 (1998), 1-61, 1998
1931998
Context-sensitive rewriting strategies
S Lucas
Information and Computation 178 (1), 294-343, 2002
1302002
Operational termination of conditional term rewriting systems
S Lucas, C Marché, J Meseguer
Information Processing Letters 95 (4), 446-453, 2005
1082005
Proving operational termination of membership equational programs
F Durán, S Lucas, C Marché, J Meseguer, X Urbain
Higher-Order and Symbolic Computation 21 (1-2), 59-88, 2008
1002008
Polynomials over the reals in proofs of termination: from theory to practice
S Lucas
RAIRO-Theoretical Informatics and Applications 39 (3), 547-586, 2005
922005
mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting
S Lucas
International Conference on Rewriting Techniques and Applications, 200-209, 2004
732004
MTT: The Maude termination tool (system description)
F Durán, S Lucas, J Meseguer
International Joint Conference on Automated Reasoning, 313-319, 2008
702008
Termination of on-demand rewriting and termination of OBJ programs
S Lucas
Proceedings of the 3rd ACM SIGPLAN international conference on Principles …, 2001
682001
The Maude formal tool environment
M Clavel, F Durán, J Hendrix, S Lucas, J Meseguer, P Ölveczky
Algebra and Coalgebra in Computer Science: Second International Conference …, 2007
662007
Proving termination of membership equational programs
F Durán, S Lucas, J Meseguer, C Marché, X Urbain
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and …, 2004
652004
SAT modulo linear arithmetic for solving polynomial constraints
C Borralleras, S Lucas, A Oliveras, E Rodríguez-Carbonell, A Rubio
Journal of Automated Reasoning 48 (1), 107-131, 2012
612012
Termination of rewriting with strategy annotations
S Lucas
International Conference on Logic for Programming Artificial Intelligence …, 2001
612001
Termination of context-sensitive rewriting by rewriting
S Lucas
Automata, Languages and Programming: 23rd International Colloquium, ICALP'96 …, 1996
581996
Solving non-linear polynomial arithmetic via SAT modulo linear arithmetic
C Borralleras, S Lucas, R Navarro-Marset, E Rodríguez-Carbonell, ...
International Conference on Automated Deduction, 294-305, 2009
552009
Termination modulo combinations of equational theories
F Durán, S Lucas, J Meseguer
Frontiers of Combining Systems: 7th International Symposium, FroCoS 2009 …, 2009
542009
Proving Termination Properties with mu-term
B Alarcón, R Gutiérrez, S Lucas, R Navarro-Marset
International Conference on Algebraic Methodology and Software Technology …, 2010
452010
Context-sensitive dependency pairs
B Alarcón, R Gutiérrez, S Lucas
International Conference on Foundations of Software Technology and …, 2006
442006
Strongly sequential and inductively sequential term rewriting systems
M Hanus, S Lucas, A Middeldorp
Information Processing Letters 67 (1), 1-8, 1998
431998
Abstract diagnosis of functional programs
M Alpuente, M Comini, S Escobar, M Falaschi, S Lucas
International Workshop on Logic-Based Program Synthesis and Transformation, 1-16, 2002
412002
Specialization of functional logic programs based on needed narrowing
M Alpuente, S Lucas, G Vidal, M Hanus
Theory and Practice of Logic Programming 5 (3), 273-303, 2005
392005
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20