The following pages link to Robert Glück (Q232939):
Displaying 50 items.
- On reversible Turing machines and their function universality (Q303695) (← links)
- Self-generating program specializers (Q407546) (← links)
- Join inverse categories and reversible recursion (Q511931) (← links)
- The universal resolving algorithm and its correctness: Inverse computation in a functional language (Q700978) (← links)
- Fundamentals of reversible flowchart languages (Q896906) (← links)
- An investigation of Jones optimality and BTI-universal specializers (Q1029807) (← links)
- Implementing reversible object-oriented language features on reversible machines (Q1705581) (← links)
- Data structures and dynamic memory management in reversible languages (Q1796393) (← links)
- An efficient composition of bidirectional programs by memoization and lazy update (Q2039945) (← links)
- A categorical foundation for structured reversible flowchart languages (Q2130590) (← links)
- From reversible programming languages to reversible metalanguages (Q2139051) (← links)
- Constructing a binary tree from its traversals by reversible recursion and iteration (Q2414043) (← links)
- Reversible computing from a programming language perspective (Q2693633) (← links)
- (Q2721101) (← links)
- (Q2729910) (← links)
- (Q2729911) (← links)
- A Classical Propositional Logic for Reasoning About Reversible Logic Circuits (Q2820684) (← links)
- A Practical Simulation Result for Two-Way Pushdown Automata (Q2830212) (← links)
- Reversible Representation and Manipulation of Constructor Terms in the Heap (Q2868440) (← links)
- Towards a Reversible Functional Language (Q2902497) (← links)
- What Do Reversible Programs Compute? (Q3000598) (← links)
- A Simple and Efficient Universal Reversible Turing Machine (Q3004571) (← links)
- (Q3149665) (← links)
- Reversible arithmetic logic unit for quantum arithmetic (Q3161083) (← links)
- Maximally-Polyvariant Partial Evaluation in Polynomial Time (Q3179173) (← links)
- An Universal Resolving Algorithm for Inverse Computation of Lazy Languages (Q3401933) (← links)
- Bootstrapping Compiler Generators from Partial Evaluators (Q3457976) (← links)
- Reversible Machine Code and Its Abstract Processor Architecture (Q3499767) (← links)
- Reversible Flowchart Languages and the Structured Reversible Program Theorem (Q3519506) (← links)
- A positive supercompiler (Q4339016) (← links)
- (Q4356835) (← links)
- (Q4358294) (← links)
- (Q4414734) (← links)
- (Q4414738) (← links)
- (Q4472445) (← links)
- A categorical foundation for structured reversible flowchart languages: Soundness and adequacy (Q4585070) (← links)
- (Q4808807) (← links)
- Conjunctive partial deduction: foundations, control, algorithms, and experiments (Q4939538) (← links)
- (Q4994698) (← links)
- (Q5020658) (← links)
- Semi-inversion of Conditional Constructor Term Rewriting Systems (Q5097640) (← links)
- Towards a Unified Language Architecture for Reversible Object-Oriented Programming (Q5162604) (← links)
- FROM STANDARD TO NON-STANDARD SEMANTICS BY SEMANTICS MODIFIERS (Q5249253) (← links)
- Functional and Logic Programming (Q5308028) (← links)
- On Jones-Optimal Specializers: A Case Study Using Unmix (Q5385609) (← links)
- (Q5389329) (← links)
- (Q5472880) (← links)
- Programming Languages and Systems (Q5902364) (← links)
- Program transformation system based on generalized partial computation (Q5957059) (← links)
- Towards clean reversible lossless compression. A reversible programming experiment with zip (Q6637591) (← links)
