Carregando...
Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving
Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In this setting, Order-Sorted First-Order Logic provides a powerfu...
Na minha lista:
Autor principal: | |
---|---|
Formato: | Artigo |
Idioma: | Inglês |
Publicado em: |
Open Publishing Association
2015-12-01
|
coleção: | Electronic Proceedings in Theoretical Computer Science |
Acesso em linha: | http://arxiv.org/pdf/1512.06943v1 |
Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
Carregando...