@prefix dcat: <http://www.w3.org/ns/dcat#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix vcard: <http://www.w3.org/2006/vcard/ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00780124v2> a dcat:Dataset ;
    dct:description """
              Tree Automata Completion is a family of techniques for computing or approximating the set of terms reachable by a rewriting relation. For functional programs translated into TRS, we give a sufficient condition for completion to terminate. Second, in order to take into account the evaluation strategy of functional programs, we show how to refine completion to approximate reachable terms for a rewriting relation controlled by a strategy. In this paper, we focus on innermost strategy which represents the call-by-value evaluation strategy.
            """ ;
    dct:identifier "hal-00780124" ;
    dct:issued "2026-05-11T00:11:48.770868"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-11T00:11:48.770873"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Tree Automata Completion for Static Analysis of Functional Programs" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00780124v2/resource/5e76f32b-17ae-4e2a-9384-888a7efd34b2> ;
    dcat:keyword "functional-program",
        "i23-deduction-and-theorem-proving-f42-grammars-and-other-rewriting-systems-d24-softwareprog",
        "infoeu-reposemanticsreport",
        "infoinfo-plcomputer-science-csprogramming-languages-cspl",
        "infoinfo-secomputer-science-cssoftware-engineering-csse",
        "reports",
        "static-analysis",
        "strategy",
        "term-rewriting-systems",
        "tree-automata" ;
    dcat:landingPage <https://hal.science/hal-00780124> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00780124v2/resource/5e76f32b-17ae-4e2a-9384-888a7efd34b2> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-11T00:11:48.787814"^^xsd:dateTime ;
    dct:modified "2026-05-11T00:11:48.760054"^^xsd:dateTime ;
    dct:title "Tree Automata Completion for Static Analysis of Functional Programs" ;
    dcat:accessURL <https://hal.science/hal-00780124> .

<https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> a foaf:Agent ;
    foaf:name "test_moissonnage_selune" .

<https://hal.science/hal-00780124> a foaf:Document .