235 results on '"Robert Glück"'
Search Results
52. On Jones-Optimal Specializers: A Case Study Using Unmix.
53. An Universal Resolving Algorithm for Inverse Computation of Lazy Languages.
54. The Program Inverter LRinv and Its Structure.
55. Derivation of Deterministic Inverse Programs Based on LR Parsing.
56. A Program Inverter for a Functional Language with Equality and Constructors.
57. Transforming interpreters into inverse interpreters by partial evaluation.
58. The Translation Power of the Futamura Projections.
59. An Automatic Program Inverter for Lisp: Potential and Limitations.
60. WSDFU: Program Transformation System Based on Generalized Partial Computation.
61. Principles of Inverse Computation and the Universal Resolving Algorithm.
62. Jones optimality, binding-time improvements, and the strength of program specializers.
63. Automatic generation of efficient string matching algorithms by generalized partial computation.
64. Jones Optimality and the Strength of Program Specializers.
65. Relating Accumulative and Non-accumulative Functional Programs.
66. On Deforesting Parameters of Accumulating Maps.
67. Optimizing Reversible Simulation of Injective Functions.
68. A self-applicable online partial evaluator for recursive flowchart languages.
69. Combining Semantics with Non-standard Interpreter Hierarchies.
70. Automatic Generation of Very Efficient Programs by Generalized Partial Computation.
71. Principles of Inverse Computation in a Functional Language.
72. The Universal Resolving Algorithm: Inverse Computation in a Functional Language.
73. Binding-Time Analysis in Partial Evaluation: One Size Does Not Fit All.
74. Abstraction-Based Partial Deduction for Solving Inverse Problems - A Transformational Approach to Software Verification.
75. Self-generating program specializers.
76. Generative Programming and Active Libraries.
77. Semantics Modifiers: An Approach to Non-Standard Semantics of Programming Languages.
78. Generalization in Hierarchies of Online Program Specialization Systems.
79. Multi-Level Specialization (Extended Abstract).
80. Introduction to Supercompilation.
81. Optimized reversible binary-coded decimal adders.
82. An investigation of Jones optimality and BTI-universal specializers.
83. Reasoning about Hierarchies of Online Program Specialization Systems.
84. A Roadmap to Metacomputation by Supercompilation.
85. Controlling Conjunctive Partial Deduction.
86. Bootstrapping higher-order program transformers from interpreters.
87. Fast Binding-Time Analysis for Multi-Level Specialization.
88. Efficient Multi-level Generating Extensions for Program Specialization
89. On the Mechanics of Metasystem Hierarchies in Program Transformation.
90. An Algorithm of Generalization in Positive Supercompilation.
91. Revisiting an automatic program inverter for Lisp.
92. A Method for Automatic Program Inversion Based on LR(0) Parsing.
93. Partial Deduction and Driving are Equivalent.
94. Generating Transformers for Deforestation and Supercompilation.
95. Generating Optimizing Specializers.
96. Partial Evaluation of Numerical Programs in Fortran.
97. Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC.
98. Offline partial evaluation can be as accurate as online partial evaluation.
99. Biting the Error: Writers Explore Narrative
100. Occam's Razor in Metacompuation: the Notion of a Perfect Process Tree.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.