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

10th acm sigplan international conference on functional programming (ICFP)

作者： Masuhara, H Tatsuzawa, H Yonezawa, A Univ Tokyo Grad Sch Arts & Sci Tokyo Japan Univ Tokyo Dept Comp Sci Tokyo Japan Univ Tokyo Dept Comp Sci Tokyo Japan

ISBN: (纸本)9781595930644

We propose an aspect-oriented programming (AOP) language called Aspectual Caml based on a strongly-typed functional language Objective Caml with two AOP mechanisms similar to those in AspectJ language. this paper describes the design and implementation issues of those AOP mechanisms that give us insights into the interaction between AOP features and common features in strongly-typed functional languages such as type inference, polymorphic types and curried functions. We implemented a prototype compiler of the language and used the language for separating crosscutting concerns in application programs, including for separating descriptions of a type system from compiler descriptions.

关键词： aspect-oriented programming objective Caml pointcut and advice

来源：评论

学校读者我要写书评

暂无评论

Continuations from generalized stack inspection

引用

acm sigplan NOTICES 2005年第9期40卷 216-227页

作者： Pettyjohn, G Clements, J Marshall, J Krishnamurthi, S Felleisen, M Northeastern Univ Boston MA 02115 USA Brown Univ Providence RI 02912 USA

Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present a novel translation that overcomes this problem. In the first half of the paper, we introduce a theoretical model that shows how to eliminate the capture and the use of first-class continuations in the presence of a generalized stack inspection mechanism. the second half of the paper explains how to translate this model into practice in two different contexts. First, we reformulate the servlet interaction language in the PLT Web server, which heavily relies on first-class continuations. Using our technique, servlet programs can be run directly under the control of non-cooperative web servers such as Apache. Second, we show how to use our new technique to copy and reconstitute the stack on *** using exception handlers. this establishes that Scheme's first-class continuations can exist on non-cooperative virtual machines.

关键词： A-normal form continuation-passing style stack inspection Web programming continuations defunctionalization Scheme

来源：评论

学校读者我要写书评

暂无评论

the anatomy of a loop - A story of scope and control 05

The anatomy of a loop - A story of scope and control

引用

10th acm sigplan international conference on functional programming (ICFP)

作者： Shivers, O Georgia Inst Technol Atlanta GA 30332 USA

ISBN: (纸本)9781595930644

Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 20 years, it is striking that none have had much success in the Scheme world. I suggest the reason is that Scheme forces us to be precise about the scoping of the various variables introduced by our loop forms, something previous attempts to design ambitious loop forms have not managed to do. I present the design of a loop package for Scheme with a well-defined and natural scoping rule, based on a notion of control dominance that generalizes the standard lexical-scope rule of the lambda-calculus. the new construct is powerful, clear, modular and extensible. the loop language is defined in terms of an underlying language for expressing control-flow graphs. this language itself has interesting properties as an intermediate representation.

关键词： design languages performance theory functional programming control structures iteration lambda-calculus compilers programming languages continuations macros Scheme

来源：评论

学校读者我要写书评

暂无评论

Scrap your nameplate (functional pearl) 05

Scrap your nameplate (Functional pearl)

引用

10th acm sigplan international conference on functional programming (ICFP)

作者： Cheney, J Univ Edinburgh Edinburgh Midlothian Scotland

ISBN: (纸本)9781595930644

Recent research has shown how boilerplate code, or repetitive code for traversing datatypes, can be eliminated using generic programming techniques already available within some implementations of Haskell. One particularly intractable kind of boilerplate is nameplate, or code having to do with names, name-binding, and fresh name generation. One reason for the difficulty is that operations on data structures involving names, as usually implemented, are not regular instances of standard map, fold, or zip operations. However, in nominal abstract syntax, an alternative treatment of names and binding based on swapping, operations such as a-equivalence, capture-avoiding substitution, and free variable set functions are much better-behaved. In this paper, we show how nominal abstract syntax techniques similar to those of FreshML can be provided as a Haskell library called FreshLib. In addition, we show how existing generic programming techniques can be used to reduce the amount of nameplate code that needs to be written for new datatypes involving names and binding to almost nothing-in short, how to scrap your nameplate.

关键词： generic programming names binding substitution

来源：评论

学校读者我要写书评

暂无评论

Combining programming with theorem proving 05

Combining programming with theorem proving

引用

10th acm sigplan international conference on functional programming (ICFP)

作者： Chen, CY Xi, HW Boston Univ Boston MA 02215 USA

ISBN: (纸本)9781595930644

Applied Type System (ATS) is recently proposed as a framework for designing and formalizing (advanced) type systems in support Of practical programming. In ATS, the definition of type equality involves a constraint relation, which may or may not be algorithmically decidable. To support practical programming, we adopted a design in the past that imposes certain restrictions on the syntactic form of constraints so that some effective means can be found for solving constraints automatically. Evidently, this is a rather ad hoc design in its nature. In this paper, we rectify the situation by presenting a fundamentally different design, which we claim to be both novel and practical. Instead of imposing syntactical restrictions on constraints, we provide a means for the programmer to construct proofs that attest to the validity of constraints. In particular, we are to accommodate a programming paradigm that enables the programmer to combine programming with theorem proving. Also we present some concrete examples in support of the practicality of this design.

关键词： languages verification ATS Applied Type System dependent types proof erasure theorem proving

来源：评论

学校读者我要写书评

暂无评论

A language-based approach to functionally correct imperative programming 05

A language-based approach to functionally correct imperative...

引用

10th acm sigplan international conference on functional programming (ICFP)

作者： Westbrook, E Stump, A Wehrman, I Washington Univ St Louis MO 63130 USA

ISBN: (纸本)9781595930644

In this paper a language-based approach to functionally correct imperative programming is proposed. the approach is based on a programming language called RSP1, which combines dependent types, general recursion, and imperative features in a type-safe way, while preserving decidability of type checking. the methodology used is that of internal verification, where programs manipulate programmer-supplied proofs explicitly as data. the fundamental technical idea of RSP1 is to identify problematic operations as impure, and keep them out of dependent types. the resulting language is powerful enough to verify statically non-trivial properties of imperative and functional programs. the paper presents the ideas through the examples of statically verified merge sort, statically verified imperative binary search trees, and statically verified directed acyclic graphs.

关键词： dependent types program verification RSP RSP1

来源：评论

学校读者我要写书评

暂无评论

Acute: High-level programming language design for distributed computation

引用

acm sigplan NOTICES 2005年第9期40卷 15-26页

作者： Sewell, P Leifer, JJ Wansbrough, K Nardelli, FZ Allen-Williams, M Habouzit, P Vafeiadis, V Univ Cambridge Cambridge CB2 1TN England

Existing languages provide good support for typeful programming of standalone programs. In a distributed system, however, there may be interaction between multiple instances of many distinct programs, sharing some (but not necessarily all) of their module structure, and with some instances rebuilt with new versions of certain modules as time goes on. In this paper we discuss programming language support for such systems, focussing on their typing and naming issues. We describe an experimental language, Acute, which extends an ML core to support distributed development, deployment, and execution, allowing type-safe interaction between separately-built programs. the main features are: (1) type-safe marshalling of arbitrary values;(2) type names that are generated (freshly and by hashing) to ensure that type equality tests suffice to protect the invariants of abstract types, across the entire distributed system;(3) expression-level names generated to ensure that name equality tests suffice for type-safety of associated values, e.g. values carried on named channels;(4) controlled dynamic rebinding of marshalled values to local resources;and (5) thunkification of threads and mutexes to support computation mobility. these features are a large part of what is needed for typeful distributed programming. they are a relatively lightweight extension of M L, should be efficiently implementable, and are expressive enough to enable a wide variety of distributed infrastructure layers to be written as simple library code above the byte-string network and persistent store APIs. this disentangles the language runtime from communication intricacies. this paper highlights the main design choices in Acute. It is supported by a full language definition (of typing, compilation, and operational semantics), by a prototype implementation, and by example distribution libraries.

关键词： languages design programming languages distributed programming marshalling serialisation abstract types modules rebinding version control type theory ML

来源：评论

学校读者我要写书评

暂无评论

An expressive language of signatures 05

An expressive language of signatures

引用

10th acm sigplan international conference on functional programming (ICFP)

作者： Ramsey, N Fisher, K Govereau, P Harvard Univ Div Engn & Appl Sci Cambridge MA 02138 USA

ISBN: (纸本)9781595930644

Current languages allow a programmer to describe an interface only by enumerating its parts, possibly including other interfaces wholesale. Such languages cannot express relationships between interfaces, yet when independently developed software components are combined into a larger system, significant relationships arise, To address this shortcoming, we define, as a conservative extension of ML, a language for manipulating interfaces. Our language includes operations for adding, renaming, and removing components;for changing the type associated with a value;for making manifest types abstract and vice versa;and for combining interfaces. these operations can express useful relationships among interfaces. We have defined a formal semantics in which an interface denotes a group of four sets;we show how these sets determine a subtyping relation, and we sketch the elaboration of an interface into its denotation.

关键词： design languages objective Caml Standard ML signatures interfaces signature manipulation programming in the large

来源：评论

学校读者我要写书评

暂无评论

Associated type synonyms 05

Associated type synonyms

引用

10th acm sigplan international conference on functional programming, ICFP 2005

作者： Chakravarty, Manuel M.T. Keller, Gabriele Peyton Jones, Simon University of New South Wales Programming Languages and Systems Australia Microsoft Research Ltd. Cambridge United Kingdom

ISBN: (纸本)1595930647

Haskell programmers often use a multi-parameter type class in which one or more type parameters are functionally dependent on the first. Although such functional dependencies have proved quite popular in practice, they express the programmer's intent somewhat indirectly. Developing earlier work on associated data types, we propose to add functionally-dependent types as type synonyms to type-class bodies. these associated type synonyms constitute an interesting new alternative to explicit functional dependencies. Copyright © 2005 acm.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Continuations from generalized stack inspection 05

Continuations from generalized stack inspection

引用

10th acm sigplan international conference on functional programming (ICFP)

作者： Pettyjohn, G Clements, J Marshall, J Krishnamurthi, S Felleisen, M Northeastern Univ Boston MA 02115 USA Brown Univ Providence RI 02912 USA

ISBN: (纸本)9781595930644

关键词： A-normal form continuation-passing style stack inspection Web programming continuations defunctionalization Scheme

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：