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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

12 篇 会议
1 册 图书

馆藏范围

13 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

12 篇 工学
- 12 篇 计算机科学与技术...
- 12 篇 软件工程
- 1 篇 控制科学与工程
6 篇 理学
- 6 篇 数学
2 篇 管理学
- 2 篇 图书情报与档案管...

主题

4 篇 computer program...
1 篇 object oriented ...
1 篇 smart contracts
1 篇 types
1 篇 programming lang...
1 篇 automatic progra...
1 篇 computer program...
1 篇 c (programming l...
1 篇 java programming...
1 篇 congresses.
1 篇 functional progr...
1 篇 virtual reality
1 篇 embedded domain ...

机构

1 篇 artificial intel...
1 篇 department of co...
1 篇 univ hong kong p...
1 篇 univ tartu dept ...
1 篇 univ pisa dipart...
1 篇 univ aix marseil...
1 篇 talinn univ tech...
1 篇 zhejiang univ pe...
1 篇 univ bologna alm...
1 篇 kyoto univ kyoto
1 篇 oxford universit...
1 篇 cnrs lif f-75700...
1 篇 department of co...
1 篇 imperial coll sc...
1 篇 univ freiburg fr...
1 篇 diku university ...
1 篇 computer science...
1 篇 seoul national u...

作者

1 篇 oliveira bruno c...
1 篇 tauber tomas
1 篇 han taisook
1 篇 thiemann peter
1 篇 kang hyun-goo
1 篇 vene v
1 篇 igarashi a
1 篇 kim youil
1 篇 chen chien-an
1 篇 whaley john
1 篇 gascon r
1 篇 kwangkeun yi
1 篇 han hwansoo
1 篇 kalvala sara
1 篇 zhang weixin
1 篇 uustalu t
1 篇 zhang zhenrui
1 篇 sereni damien
1 篇 binder walter
1 篇 hankin c

语言

12 篇 英文
1 篇 中文

检索条件"任意字段=3rd Asian Symposium on Programming Languages and Systems, APLAS 2005"

共 13 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

A Typed Programmatic Interface to Contracts on the Blockchain 19th

A Typed Programmatic Interface to Contracts on the Blockchai...

引用

19th asian symposium on programming languages and systems (aplas)

作者： Thi Thu Ha Doan Thiemann, Peter Univ Freiburg Freiburg Germany

ISBN: (纸本)9783030890513;9783030890506

Smart contract applications on the blockchain can only reach their full potential if they integrate seamlessly with traditional software systems via a programmatic interface. This interface should provide for originating and invoking contracts as well as observing the state of the blockchain. We propose a typed API for this purpose and establish some properties of the combined system. Specifically, we provide an execution model that enables us to prove type-safe interaction between programs and the blockchain. We establish further properties of the model that give rise to requirements on the API. A prototype of the interface is implemented in OCaml for the Tezos blockchain.

关键词： Smart contracts Embedded domain specific languages Types

来源：评论

学校读者我要写书评

暂无评论

Memory-Efficient Tail Calls in the JVM with Imperative Functional Objects 13th

Memory-Efficient Tail Calls in the JVM with Imperative Funct...

引用

13th asian symposium on programming languages and systems (aplas)

作者： Tauber, Tomas Bi, Xuan Shi, Zhiyuan Zhang, Weixin Li, Huang Zhang, Zhenrui Oliveira, Bruno C. D. S. Univ Hong Kong Pok Fu Lam Rd Hong Kong Hong Kong Peoples R China Zhejiang Univ Hangzhou 310003 Zhejiang Peoples R China

ISBN: (纸本)9783319265292;9783319265285

This paper presents FCore: a JVM implementation of System F with support for full tail-call elimination (TCE). Our compilation technique for FCore is innovative in two respects: it uses a new representation for first-class functions called imperative functional objects;and it provides a way to do TCE on the JVM using constant space. Unlike conventional TCE techniques on the JVM, allocated function objects are reused in chains of tail calls. Thus, programs written in FCore can use idiomatic functional programming styles, relying on TCE, and perform well without worrying about the JVM limitations. Our empirical results show that programs which use tail calls can run in constant space and with low execution time overhead when compiled with FCore.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

programming languages and systems - Third asian symposium, aplas 2005, Proceedings

引用

3rd asian symposium on programming languages and systems, aplas 2005

ISBN: (纸本)3540297359

The proceedings contain 27 papers. The topics discussed include: the essence of dataflow programming;data refinement with low-level pointer operations;a simple semantics for polymorphic recursion;an abstract interpretation perspective on linear vs. branching time;using datalog with binary decision diagrams for program analysis;loop invariants on demand;integrating physical systems in the static analysis of embedded control software;calculating polynomial runtime properties;resource bound certification for a tail-recursive virtual machine;a path sensitive type system for resource usage verification of C like languages;termination analysis of higher-order functional programs;register allocation via coloring of charcoal graphs;and transformation to dynamic single assignment using a simple data flow analysis.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Race conditions in message sequence charts

引用

3rd asian symposium on programming languages and systems, aplas 2005

作者： Chen, Chien-An Kalvala, Sara Sinclair, Jane Department of Computer Science University of Warwick Coventry CV4 7AL United Kingdom

ISBN: (纸本)3540297359

Message Sequence Charts (MSCs) are a graphical language for the description of scenarios in terms of message exchanges between communicating components in a distributed environment. The language has been standardised by the ITU and given a formal semantics by means of a process algebra. In this paper, we review a design anomaly, called race condition, in an MSC specification and argue that the current solution correcting race conditions is too weak when implementation is considered. In this paper, we provide an algorithm on partial orders as our solution. The result is a strengthened partial order, which is race-free and remains race-free in the implementation. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

A portable and customizable profiling framework for java based on bytecode instruction counting

引用

3rd asian symposium on programming languages and systems, aplas 2005

作者： Binder, Walter Artificial Intelligence Laboratory CH-1015 Lausanne Switzerland

ISBN: (纸本)3540297359

Prevailing profilers for Java, which rely on standard, native-code profiling interfaces, are not portable, give imprecise results due to serious measurement perturbation, and cause excessive overheads. In contrast, program transformations allow to generate reproducible profiles in a fully portable way with significantly less overhead. This paper presents a profiling framework that instruments Java programs at the bytecode level to build context-sensitive execution profiles at runtime. The profiling framework includes an exact profiler as well as a sampling profiler. User-defined profiling agents can be written in pure Java, too, in order to customize the runtime processing of profiling data. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

A path sensitive type system for resource usage verification of C like languages

引用

3rd asian symposium on programming languages and systems, aplas 2005

作者： Kang, Hyun-Goo Kim, Youil Han, Taisook Han, Hwansoo Department of Computer Science Korea Advanced Institute of Science and Technology

ISBN: (纸本)3540297359

In this paper, we present a path sensitive type system for resource usage verification. Path sensitivity is essential to model resource usage in C programs correctly and accurately. So far, most of methods to analyze this kind of property in the path sensitive way have been proposed as whole program analyses or unsound analyses. Our main contributions are as follows. First, we formalize a sound analysis for path sensitive resource usage properties in C like languages. To the best of our knowledge, it is the first sound and modular analysis for this problem. We provide the complete proof for the soundness of the type system and algorithm. Second, our analysis is modular, and we provide an inference algorithm to generate function summaries automatically. We believe that our approach suggests new insights into the design of modular analyses. © Springer-Verlag Berlin Heidelberg 2005.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Termination analysis of higher-order functional programs

引用

3rd asian symposium on programming languages and systems, aplas 2005

作者： Sereni, Damien Jones, Neil D. Oxford University Computing Laboratory DIKU University of Copenhagen

ISBN: (纸本)3540297359

Size-change termination (SCT) automatically identifies termination of first-order functional programs. The SCT principle: a program terminates if every infinite control flow sequence would cause an infinite descent in a well-founded data value (POPL 2001). More recent work (RTA 2004) developed a termination analysis of the pure untyped A-calculus using a similar approach, but an entirely different notion of size was needed to compare higher-order values. Again this is a powerful analysis, even proving termination of certain A-expressions containing the fixpoint combinator Y. However the language analysed is tiny, not even containing constants. These techniques are unified and extended significantly, to yield a termination analyser for higher-order, call-by-value programs as in ML's purely functional core or similar functional languages. Our analyser has been proven correct, and implemented for a substantial subset of OCaml. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Automatic programming

来源：评论

学校读者我要写书评

暂无评论

The essence of dataflow programming

引用

3rd asian symposium on programming languages and systems

作者： Uustalu, T Vene, V Talinn Univ Technol Inst Cybernet EE-12618 Tallinn Estonia Univ Tartu Dept Comp Sci EE-50409 Tartu Estonia

ISBN: (纸本)3540297359

We propose a novel, comonadic approach to dataflow (stream-based) computation. This is based on the observation that both general and causal stream functions can be characterized as coKleisli arrows of comonads and on the intuition that comonads in general must be a good means to structure context-dependent computation. In particular, we develop a generic comonadic interpreter of languages for context-dependent computation and instantiate it for stream-based computation. We also discuss distributive laws of a comonad over a monad as a means to structure combinations of effectful and context-dependent computation. We apply the latter to analyse clocked dataflow (partial stream based) computation.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Lightweight family polymorphism

引用

3rd asian symposium on programming languages and systems

作者： Igarashi, A Saito, C Viroli, M Kyoto Univ Kyoto Japan Univ Bologna Alma Mater Studiorum Bologna Italy

ISBN: (纸本)3540297359

Family polymorphism has been proposed for object-oriented languages as a solution to supporting reusable yet type-safe mutually recursive classes. A key idea of family polymorphism is the notion of families, which are used to group mutually recursive classes. In the original proposal, due to the design decision that families are represented by objects, dependent types had to be introduced, resulting in a rather complex type system. In this paper, we propose a simpler solution of lightweight family polymorphism, based on the idea that families are represented by classes rather than objects. This change makes the type system significantly simpler without losing much expressibility of the language. Moreover, "family-polymorphic" methods now take a form of parametric methods;thus it is easy to apply the Java-style type inference. To rigorously show that our approach is safe, we formalize the set of language features on top of Featherweight Java and prove the type system is sound. An algorithm of type inference for family-polymorphic method invocations is also formalized and proved to be correct.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Resource bound certification for a tail-recursive virtual machine

引用

3rd asian symposium on programming languages and systems

作者： Dal Zilio, S Gascon, R CNRS LIF F-75700 Paris France Univ Aix Marseille 1 F-13331 Marseille 3 France

ISBN: (纸本)3540297359

We define a method to statically bound the size of values computed during the execution of a program as a function of the size of its parameters. More precisely, we consider bytecode programs that should be executed on a simple stack machine with support for algebraic data types;pattern-matching and tail-recursion. Our size verification method is expressed as a static analysis, performed at the level of the bytecode, that relies on machine-checkable certificates. We follow here the usual assumption that code and certificates may be forged and should be checked before execution. Our approach extends a system of static analyses based on the notion of quasi-interpretations that has already been used to enforce resource bounds on first-order functional programs. This paper makes two additional contributions. First, we are able to check optimized programs, containing instructions for unconditional jumps and tail-recursive calls, and remove restrictions on the structure of the bytecode that was imposed in previous works. Second, we propose a direct algorithm that depends only on solving a set of arithmetical constraints.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共2页 << < 1 2 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：