Search for Topics All Reviews
	Browse All Reviews > Software (D) > Programming Techniques (D.1) > Automatic Programming (D.1.2)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 47 Reviews about "Automatic Programming (D.1.2)": Date Reviewed   Morphing: structurally shaping a class by reflecting on others Huang S., Smaragdakis Y.  ACM Transactions on Programming Languages and Systems 33(2): 1-44, 2011. Type: Article Language designers have continuously explored various mechanisms to adapt code for reuse with a different purpose. Morphing is the latest concept to extend the notion of genericity to where the actual structure of a class can vary according to... Jul 25 2011   I/O guided detection of list catamorphisms: towards problem specific use of program templates in IP Hofmann M., Kitzelmann E.  PEPM 2010 (Proceedings of the 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Madrid, Spain,  Jan 18-19, 2010) 93-100, 2010. Type: Proceedings In contrast to classical programming, which works from an assumed-to-be-complete specification to a particular implementation, the aim of inductive programming (IP) is to find algorithms that deal with known-to-be-incomplete information, such as... Aug 2 2010   Optimizations for quadrature representations of finite element tensors through automated code generation Ølgaard K., Wells G.  ACM Transactions on Mathematical Software 37(1): 1-23, 2010. Type: Article There are various techniques to numerically solve differential equations: finite differences, finite elements, finite volume, spectral elements, and more. This paper deals with finite element approximation.... May 24 2010   Program interpolation Moss A., Page D.  PEPM 2009 (Proceedings of the 2009 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Savannah, GA,  Jan 19-20, 2009) 31-40, 2008. Type: Proceedings There continues to be an evolving realization of an increasing discrepancy between current programming languages and hardware architectures. Furthermore, for such a rapidly moving target as today’s computing platforms, optimizing with... May 8 2009   Specialization for applications using shared libraries Zhu P., Khoo S.  Partial evaluation and semantics-based program manipulation (Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, San Francisco, California,  Jan 7-8, 2008) 159-168, 2008. Type: Proceedings Zhu and Khoo present a novel approach to the runtime specialization of C applications that use shared libraries. In contrast to static libraries, shared libraries are not linked to every application that uses them. Rather, only a reference to a... Mar 7 2008   The complexity of agent design problems: determinism and history dependence Wooldridge M., Dunne P.  Annals of Mathematics and Artificial Intelligence 45(3-4): 343-371, 2005. Type: Article Experience teaches programmers that some problems are hard. The theory of computation proves that some have no algorithmic solution. Complexity theory suggests that some solvable problems have no efficient algorithm. A program must try all... Jun 28 2006   Termination analysis and specialization-point insertion in offline partial evaluation Glenstrup A., Jones N.  ACM Transactions on Programming Languages and Systems 27(6): 1147-1215, 2005. Type: Article The main goal of partial evaluation is program specialization. Essentially, given a program and part of its input data, a partial evaluator returns a new, residual program that is specialized for the given data. In the optimal case, all... Mar 1 2006   Program transformation by templates based on term rewriting Chiba Y., Aoto T., Toyama Y.  Principles and practice of declarative programming (Proceedings of the 7th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, Lisbon, Portugal,  Jul 11-13, 2005) 59-69, 2005. Type: Proceedings The automatic rewriting of programming code to enhance efficiency is fundamental to compiler design, and is an important area in theoretical computer science. The most typical current practice uses templates that comprise input and output schemas ... Sep 8 2005   A framework for the integration of partial evaluation and abstract interpretation of logic programs Leuschel M.  ACM Transactions on Programming Languages and Systems 26(3): 413-463, 2004. Type: Article This paper is concerned with the application of partial evaluation techniques to logic programs. It points out, therefore, how partial deduction can be integrated into the execution of queries given to a logic program. The input (namely, bindings ... Dec 26 2004   The power of symmetry: unifying inheritance and generative programming Hutchins D.  Object-oriented programming, systems, languages, and applications (Companion of the 18th annual ACM SIGPLAN conference, Anaheim, CA, USA,  Oct 26-30, 2003) 38-52, 2003. Type: Proceedings The author describes a programming language, Ohmu, as well as an object-oriented (OO) model of the same name, which unifies the concepts of functions, classes, instances, templates, and aspects into a single construct, the structure. If one... Jan 26 2004       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2013 ThinkLoud, Inc. Terms of Use | Privacy Policy