检索结果-内蒙古大学图书馆

A History of the Groovy Programming Language

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2020年第HOPL期4卷 1–53页

作者： King, Paul Object Comp Brisbane Qld Australia

This paper describes the history of the Groovy programming language. At the time of Groovy's inception, Java was a dominant programming language with a wealth of useful libraries. Despite this, it was perceived by some to be evolving slowing and to have shortcomings for scripting, rapid prototyping and when trying to write minimalistic code. Other languages seemed to be innovating faster than Java and, while overcoming some of Java's shortcomings, used syntax that was less familiar to Java developers. Integration with Java libraries was also non-optimal. Groovy was created as a complementary language to JavaDits dynamic counterpart. It would look and feel like Java but focus on extensibility and rapid innovation. Groovy would borrow ideas from dynamic languages like Ruby, Python and Smalltalk where needed to provide compelling JVM solutions for some of Java's shortcomings. Groovy supported innovation through its runtime and compile-time metaprogramming capabilities. It supported simple operator overloading, had a flexible grammar and was extensible. These characteristics made it suitable for growing the language to have new commands (verbs) and properties (nouns) specific to a particular domain, a so called Domain Specific Language (DSL). While still intrinsically linked with Java, over time Groovy has evolved from a niche dynamic scripting language into a compelling mainstream language. After many years as a principally dynamically-typed language, a static nature was added to Groovy. Code could be statically type checked or when dynamic features weren't needed, they could be turned off entirely for Java-like performance. A number of nuances to the static nature came about to support the style of coding used by Groovy developers. Many choices made by Groovy in its design, later appeared in other languages (Swift, C#, Kotlin, Ceylon, PHP, Ruby, Coffeescript, Scala, Frege, TypeScript and Java itself). This includes Groovy's dangling closure, Groovy builders, null-safe

关键词： Dynamic typing Static typing Object-oriented Functional programming Closure Scripting Domain Specific Languages metaprogramming Extensibility

来源：评论

学校读者我要写书评

暂无评论

Genetic evolution of programs

引用

OPEN COMPUTER SCIENCE 2014年第3期4卷 160-170页

作者： Kollar, Jan Pietrikova, Emilia Tech Univ Kosice Fac Elect Engn & Informat Dept Comp & Informat Letna 9 Kosice 04200 Slovakia

We present evolutionary approach to program development based on absorption of genetic strings at different metalevels. Introducing the principles of software evolution as processes of semantical stability, expansion and contraction, we continue with an example illustrating how it is possible to integrate metalevel with base level and how this integrated computation works when driven by genetic string of codons, determining decisions for program construction and the result of constructed program execution. Next, we analyse the evolutionary circle at metalevel and we show that mentioned expansion and contraction is possible. The main contribution of the paper is that it breaks classic boundaries between models and programs because formal binding of metalevels and base level have been reached.

关键词： software evolution genetic evolution of programs executable metalanguages metaprogramming

来源：评论

学校读者我要写书评

暂无评论

PARTIAL EVALUATION OF METAPROGRAMS IN A MULTIPLE WORLDS LOGIC LANGUAGE

引用

NEW GENERATION COMPUTING 1988年第2-3期6卷 227-247页

作者： LEVI, G SARDU, G SYST & MANAGEMENT SPA PISAITALY

This paper describes a partial evaluation system specifically designed to be used as an automatic compilation tool for metaprograms in a KBMS (EPSILON) based on Prolog. EPSILON main underlying concepts are the extension of Prolog with theories (“multiple worlds”) and the use of metaprogramming as the basic technique to define new inference engines and tools. Our partial evaluator is oriented towards theories and metainterpreter specialization. Being designed to be used as an automatic compiler, it does not require declarations from the user to control the unfolding process. It handles full Prolog and provides also an elegant solution to the problem of the partial evaluation of incomplete and self-modifying programs, by exploiting the multiple worlds feature added to Prolog. EPSILON partial evaluation system turned out to be a very useful and powerful tool to combine the low cost and the flexibility of metaprogramming with the performance requirements of a practical knowledge based system.

关键词： Knowledge Base Management Systems Logic Programming Metainterpreter Compilation metaprogramming Multiple Worlds Partial Evaluation

来源：评论

学校读者我要写书评

暂无评论

Incremental Rebinding with Name Polymorphism

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2016年 322卷 19-34页

作者： Ancona, Davide Giannini, Paola Zucca, Elena Univ Genoa DIBRIS Genoa Italy Univ Piemonte Orientale CS Inst DISIT Alessandria Italy

We propose an extension with name variables of a calculus for incremental rebinding of code introduced in previous work. Names, which can be either constants or variables, are used as interface of fragments of code with free variables. Open code can be dynamically rebound by applying a rebinding, which is an association from names to terms. Rebinding is incremental, since rebindings can contain free variables as well, and can be manipulated by operators such as overriding and renaming. By using name variables, it is possible to write terms which are parametric in their nominal interface and/or in the way it is adapted, greatly enhancing expressivity. The type system is correspondingly extended by constrained name-polymorphic types, where simple inequality constraints prevent conflicts among parametric name interfaces.

关键词： open code incremental rebinding name polymorphism metaprogramming

来源：评论

学校读者我要写书评

暂无评论

Mtac2: Typed Tactics for Backward Reasoning in Coq

引用

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2018年第ICFP期2卷 1–31页

作者： Kaiser, Jan-Oliver Ziliani, Beta Krebbers, Robbert Regis-Gianas, Yann Dreyer, Derek MPI SWS Saarland Informat Campus Saarbrucken Germany Consejo Nacl Invest Cient & Tecn Buenos Aires DF Argentina UNC FAMAF Buenos Aires DF Argentina Delft Univ Technol Delft Netherlands CNRS Paris Diderot IRIF Paris France INRIA PI R2 Palaiseau France

Coq supports a range of built-in tactics, which are engineered primarily to support backward reasoning. Starting from a desired goal, the Coq programmer can use these tactics to manipulate the proof state interactively, applying axioms or lemmas to break the goal into subgoals until all subgoals have been solved. Additionally, it provides support for tactic programming via OCaml and Ltac, so that users can roll their own custom proof automation routines. Unfortunately, though, these tactic languages share a significant weakness. They do not offer the tactic programmer any static guarantees about the soundness of their custom tactics, making large tactic developments difficult to maintain. To address this limitation, Ziliani et al. previously proposed Mtac, a new typed approach to custom proof automation in Coq which provides the static guarantees that OCaml and Ltac are missing. However, despite its name, Mtac is really more of a rnetaprogramming language than it is a full-blown tactic language: it misses an essential feature of tactic programming, namely the ability to directly manipulate Coq's proof state and perform backward reasoning on it. In this paper, we present Mtac2, a next-generation version of Mtac that combines its support for typed metaprogramming with additional support for the programming of backward-reasoning tactics in the style of Ltac. In so doing, Mtac2 introduces a novel feature in tactic programming languages what we call typed backward reasoning. With this feature, Mtac2 is capable of statically ruling out several classes of errors that would otherwise remain undetected at tactic definition time. We demonstrate the utility of Mtac2's typed tactics by porting several tactics from a large Coq development, the Iris Proof Mode, from Ltac to Mtac2.

关键词： Theorem Proving Tactic Languages metaprogramming Dependent Types Coq

来源：评论

学校读者我要写书评

暂无评论

Prototyping a Functional Language using Higher-Order Logic Programming: A Functional Pearl on Learning the Ways of lambda Prolog/Makam

引用

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2018年第ICFP期2卷 1–30页

作者： Stampoulis, Antonis Chlipala, Adam Originate Inc New York NY 10013 USA MIT CSAIL Cambridge MA USA

We demonstrate how the framework of higher-order logic programming, as exemplified in the lambda Prolog language design, is a prime vehicle for rapid prototyping of implementations for programming languages with sophisticated type systems. We present the literate development of a type checker for a language with a number of complicated features, culminating in a standard ML-style core with algebraic datatypes and type generalization, extended with staging constructs that are generic over a separately defined language of terms. We add each new feature in sequence, with little to no changes to existing code. Scaling the higher-order logic programming approach to this setting required us to develop approaches to challenges like complex variable binding patterns in object languages and performing generic structural traversals of code, making use of novel constructions in the setting of lambda Prolog, such as GADIs and generic programming. For our development, we make use of Makam, a new implementation of lambda Prolog, which we introduce in tutorial style as part of our (quasi-)literate development.

关键词： higher-order logic programming programming language prototyping metaprogramming

来源：评论

学校读者我要写书评

暂无评论

Dynamics for ML using Meta-Programming

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2011年第5期264卷 3-21页

作者： Gazagnaire, Thomas Madhavapeddy, Anil INRIA Sophia Antipolis Mediterranee 2004 Route LuciolesBP 93 F-06902 Sophia Antipolis France Comp Lab Cambridge CB3 0FD England

We present the design and implementation of dynamic type and value introspection for the OCaml language. Unlike previous attempts, we do not modify the core compiler or type-checker, and instead use the camlp4 metaprogramming tool to generate appropriate definitions at compilation time. Our dynamics library significantly eases the task of generating generic persistence and I/O functions in OCaml programs, without requiring the full complexity of fully-staged systems such as MetaOCaml. As a motivating use of the library, we describe a SQL backend which generates type-safe functions to persist and retrieve values from a relational database, without requiring programmers to ever use SQL directly.

关键词： ocaml metaprogramming generative database sql dynamics

来源：评论

学校读者我要写书评

暂无评论

Staged Generic Programming

引用

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2017年第ICFP期1卷 1-29页

作者： Yallop, Jeremy Univ Cambridge Cambridge England

Generic programming libraries such as Scrap Your Boilerplate eliminate the need to write repetitive code, but typically introduce significant performance overheads. This leaves programmers with the regrettable choice between writing succinct but slow programs and writing tedious but efficient programs. Applying structured multi-stage programming techniques transforms Scrap Your Boilerplate from an inefficient library into a typed optimising code generator, bringing its performance in line with hand-written code, and so combining high-level programming with uncompromised performance.

关键词： multi-stage programming generic programming metaprogramming partial evaluation

来源：评论

学校读者我要写书评

暂无评论

Typing constraint logic programs

引用

THEORY AND PRACTICE OF LOGIC PROGRAMMING 2001年第6期1卷 751-777页

作者： Fages, F Coquery, E INRIA Rocquencourt Projet Contraintes F-78153 Le Chesnay France

We present a prescriptive type system with parametric polymorphism and subtyping for constraint logic programs. The aim of this type system is to detect programming errors statically. It introduces a type discipline for constraint logic programs and modules, while maintaining the capabilities of performing the usual coercions between constraint domains. and of typing meta-programming predicates, thanks to the flexibility of subtyping. The property of subject reduction expresses the consistency of a prescriptive type system w.r.t. the execution model: if a program is 'well-typed'. then all derivations starting from a 'well-typed' goat are again 'well-typed'. That property is proved w.r.t. the abstract execution model of constraint programming which proceeds by accumulation of constraints only. and w.r.t. an enriched execution model with type constraints for substitutions. We describe our implementation of the system for type checking and type inference. We report our experimental results on type checking ISO-Prolog, the (constraint) libraries of Sicstus Prolog and other Prolog programs.

关键词： type systems Prolog Constraint logic programming subtyping metaprogramming

来源：评论

学校读者我要写书评

暂无评论

CONCERTO: A Framework for Combined Concrete and Abstract Interpretation

引用

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2019年第POPL期3卷 1-29页

作者： Toman, John Grossman, Dan Univ Washington Seattle WA 98195 USA

interpretation promises sound but computable static summarization of program behavior. However, modern software engineering practices pose significant challenges to this vision, specifically the extensive use of frameworks and complex libraries. Frameworks heavily use reflection, metaprogramming, and multiple layers of abstraction, all of which confound even state-of-the-art abstract interpreters. Sound but conservative analysis of frameworks is impractically imprecise, and unsoundly ignoring reflection and metaprogramming is untenable given the prevalence of these features. Manually modeling framework behaviors offers excellent precision, at the cost of immense effort by the tool designer. To overcome the above difficulties, we present CONCERTO, a system for analyzing framework-based applications by soundly combining concrete and abstract interpretation. CONCERTO analyzes framework implementations using concrete interpretation, and application code using abstract interpretation. This technique is possible in practice as framework implementations typically follow a single path of execution when provided a concrete, application-specific configuration file which is often available at analysis time. CONCERTO exploits this configuration information to precisely resolve reflection and other metaprogramming idioms during concrete execution. In contrast, application code may have infinitely many paths of execution, so CONCERTO switches to abstract interpretation to analyze application code. CONCERTO is an analysis framework, and can be instantiated with any abstract interpretation that satisfies a small set of preconditions. In addition, unlike manual modeling, CONCERTO is not specialized to any specific framework implementation. We have formalized our approach and proved several important properties including soundness and termination. In addition, we have implemented an initial proof of concept prototype of CONCERTO for a subset of Java, and found that our combined inter

关键词： abstract interpretation state separation reflection framework-based applications metaprogramming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：