{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q5255106","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q5255106","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q5255106","kernelVersion":"v1","immutable":true,"modified":"2026-01-21T08:28:33Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q5255106","name":"Higher-order multi-parameter tree transducers and recursion schemes for program verification","headline":"Higher-order multi-parameter tree transducers and recursion schemes for program verification","description":"scientific article; zbMATH DE number 6445119","url":"https://portal.mardi4nfdi.de/entity/Q5255106","datePublished":"2015-06-11","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q238500"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5255105"},{"@id":"https://portal.mardi4nfdi.de/entity/Q832226"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q5255055"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1145/1706299.1706355","url":"https://doi.org/10.1145/1706299.1706355"},"sameAs":["https://doi.org/10.1145/1706299.1706355"]},"provenance":{"prov:generatedAtTime":"2026-01-21T08:28:33Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}