A regeneration scheme for generating extensions

DOI10.1016/S0020-0190(97)00055-0zbMATH Open1337.68071OpenAlexW2006602789MaRDI QIDQ290228FDOQ290228

Authors: Robert Glück, Andrei Klimov 

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00055-0

Recommendations

• Extensions defined using bornologies
• scientific article; zbMATH DE number 3850062
• Generating Linear Extensions Fast
• Consistent extensions
• Simultaneous extensions revisited
• scientific article; zbMATH DE number 837782
• Extensor-coding
• Iterated extensions

zbMATH Keywords

programming languagesmetacomputationpartial evaluationprogram compositionprogram generation

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• The concept of a supercompiler
• Title not available (Why is that?)
• Title not available (Why is that?)
• Deforestation: Transforming programs to eliminate trees

Cited In (4)

• Title not available (Why is that?)
• An investigation of Jones optimality and BTI-universal specializers
• Title not available (Why is that?)
• Some Transformations of Relevance to Report Generation

Uses Software

• Refal

This page was built for publication: A regeneration scheme for generating extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290228)