A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages (Q4669646): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q60501149 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1017/s1471068403001868 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2141598841 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:44, 30 July 2024
scientific article; zbMATH DE number 2157087
Language | Label | Description | Also known as |
---|---|---|---|
English | A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages |
scientific article; zbMATH DE number 2157087 |
Statements
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages (English)
0 references
15 April 2005
0 references
logic programming
0 references
abstract unification
0 references