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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

623 篇 会议
77 篇 期刊文献
5 册 图书

馆藏范围

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

日期分布

学科分类号

560 篇 工学
- 489 篇 软件工程
- 400 篇 计算机科学与技术...
- 32 篇 控制科学与工程
- 31 篇 电气工程
- 23 篇 信息与通信工程
- 12 篇 生物工程
- 10 篇 建筑学
- 6 篇 土木工程
- 5 篇 力学（可授工学、理...
- 5 篇 电子科学与技术（可...
- 4 篇 化学工程与技术
- 3 篇 光学工程
- 3 篇 材料科学与工程（可...
- 3 篇 动力工程及工程热...
- 3 篇 石油与天然气工程
- 2 篇 机械工程
- 2 篇 农业工程
74 篇 理学
- 51 篇 数学
- 15 篇 生物学
- 7 篇 统计学（可授理学、...
- 6 篇 物理学
- 5 篇 系统科学
- 4 篇 化学
30 篇 教育学
- 29 篇 教育学
23 篇 管理学
- 14 篇 图书情报与档案管...
- 9 篇 管理科学与工程(可...
- 6 篇 工商管理
9 篇 法学
- 8 篇 社会学
3 篇 农学
- 3 篇 作物学
3 篇 医学
2 篇 经济学
- 2 篇 应用经济学

主题

92 篇 functional progr...
77 篇 languages
65 篇 computer program...
54 篇 design
34 篇 haskell
25 篇 programming
23 篇 computer program...
22 篇 performance
19 篇 logic programmin...
19 篇 dependent types
19 篇 theory
18 篇 dynamic programm...
16 篇 programming lang...
15 篇 algorithms
15 篇 functional react...
15 篇 generic programm...
14 篇 object oriented ...
12 篇 verification
11 篇 domain-specific ...
11 篇 continuations

机构

7 篇 portland state u...
6 篇 northeastern uni...
6 篇 chalmers univ te...
4 篇 inria
4 篇 carnegie mellon ...
4 篇 carnegie mellon ...
4 篇 univ penn philad...
4 篇 microsoft res ca...
3 篇 georgia inst tec...
3 篇 indiana univ blo...
3 篇 princeton univ p...
3 篇 univ edinburgh e...
3 篇 univ strathclyde...
3 篇 univ new s wales...
3 篇 univ cambridge c...
3 篇 univ utah salt l...
3 篇 yale univ dept c...
3 篇 univ washington ...
3 篇 brown univ provi...
2 篇 intel res berkel...

作者

5 篇 claessen koen
5 篇 jones mark p.
5 篇 krishnaswami nee...
4 篇 flatt matthew
4 篇 xi hw
4 篇 mcbride conor
4 篇 vafeiadis viktor
4 篇 weirich stephani...
4 篇 jeuring johan
4 篇 chlipala adam
4 篇 dreyer derek
4 篇 keller gabriele
4 篇 findler robert b...
4 篇 walker david
3 篇 dolstra eelco
3 篇 loh andres
3 篇 leshchinskiy rom...
3 篇 schmidt-schauss ...
3 篇 pottier francois
3 篇 walker d

语言

643 篇 英文
57 篇 其他
4 篇 中文
1 篇 德文

检索条件"任意字段=13th ACM SIGPLAN International Conference on Functional Programming"

共 705 条记录，以下是81-90 订阅

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

详细简洁

排序：

Practical Principled FRP Forget the Past, Change the Future, FRPNow! 2015

Practical Principled FRP Forget the Past, Change the Future,...

引用

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

作者： van der Ploeg, Atze Claessen, Koen Chalmers Univ Technol Gothenburg Sweden

ISBN: (纸本)9781450336697

We present a new interface for practical functional Reactive programming (FRP) that (1) is close in spirit to the original FRP ideas, (2) does not have the original space-leak problems, without using arrows or advanced types, and (3) provides a simple and expressive way for performing I/O actions from FRP code. We also provide a denotational semantics for this new interface, and a technique (using Kripke logical relations) for reasoning about which FRP functions may "forget their past", i.e. which functions do not have an inherent space-leak. Finally, we show how we have implemented this interface as a Haskell library called FRPNow.

关键词： functional Reactive programming Space-leak Purely functional I/O Kripke logical relations

来源：评论

学校读者我要写书评

暂无评论

functional Pearl: A SQL to C Compiler in 500 Lines of Code 2015

Functional Pearl: A SQL to C Compiler in 500 Lines of Code

引用

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

作者： Rompf, Tiark Amin, Nada Ecole Polytech Fed Lausanne Lausanne Switzerland

ISBN: (纸本)9781450336697

We present the design and implementation of a SQL query processor that outperforms existing database systems and is written in just about 500 lines of Scala code - a convincing case study that high-level functional programming can handily beat C for systems-level programming where the last drop of performance matters. the key enabler is a shift in perspective towards generative programming. the core of the query engine is an interpreter for relational algebra operations, written in Scala. Using the open-source LMS Framework (Lightweight Modular Staging), we turn this interpreter into a query compiler with very low effort. To do so, we capitalize on an old and widely known result from partial evaluation known as Futamura projections, which state that a program that can specialize an interpreter to any given input program is equivalent to a compiler. In this pearl, we discuss LMS programming patterns such as mixed-stage data structures (e.g. data records with static schema and dynamic field components) and techniques to generate low-level C code, including specialized data structures and data loading primitives.

关键词： SQL Query Compilation Staging Generative programming Futamura Projections

来源：评论

学校读者我要写书评

暂无评论

On Teaching How to Design Programs Observations from a Newcomer 14

On Teaching <i>How to Design Programs</i> Observations from ...

引用

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

作者： Ramsey, Norman Tufts Univ Dept Comp Sci Medford MA 02155 USA

ISBN: (纸本)9781450328739

this paper presents a personal, qualitative case study of a first course using How to Design Programs and its functional teaching languages. the paper reconceptualizes the book's six-step design process as an eight-step design process ending in a new "review and refactor" step. It recommends specific approaches to students' difficulties with function descriptions, function templates, data examples, and other parts of the design process. It connects the process to interactive "world programs." It recounts significant, informative missteps in course design and delivery. Finally, it identifies some unsolved teaching problems and some potential solutions.

关键词： Introductory programming course Program by Design How to Design Programs Racket Reflective practice

来源：评论

学校读者我要写书评

暂无评论

CPP 2024 - Proceedings of the 13th acm sigplan international conference on Certified Programs and Proofs, Co-located with: POPL 2024

CPP 2024 - Proceedings of the 13th ACM SIGPLAN International...

引用

13th acm sigplan international conference on Certified Programs and Proofs, CPP 2024, in affiliation with the annual Symposium on Principles of programming, Languages, ,POPL 2024

ISBN: (纸本)9798400704888

the proceedings contain 20 papers. the topics discussed include: UTC time, formally verified;VCFloat2: floating-point error analysis in coq;the last yard: foundational end-to-end verification of high-speed cryptography;rooting for efficiency: mechanized reasoning about array-based trees in separation logic;compositional verification of concurrent C programs with search structure templates;unification for subformula linking under quantifiers;PfComp: a verified compiler for packet filtering leveraging binary decision diagrams;memory simulations, security and optimization in a verified compiler;lean formalization of extended regular expression matching with lookarounds;certification of confluence- and commutation-proofs via parallel critical pairs;a temporal differential dynamic logic formal embedding;and strictly monotone Brouwer trees for well-founded recursion over multiple arguments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Untangling Mechanized Proofs 13

Untangling Mechanized Proofs

引用

13th acm sigplan international conference on Software Language Engineering (SLE) part of SPLASH conference

作者： Pit-Claudel, Clement MIT CSAIL Cambridge MA 02139 USA

ISBN: (纸本)9781450381765

Proof assistants like Coq, Lean, or HOL4 rely heavily on stateful meta-programs called scripts to assemble proofs. Unlike pen-and-paper proofs, proof scripts only describe the steps to take (induct on x, apply a theorem,.), not the states that these steps lead to;as a result, plain proof scripts are essentially incomprehensible without the assistance of an interactive user interface able to run the script and show the corresponding proof states. Until now, the standard process to communicate a proof without forcing readers to execute its script was to manually copy-paste intermediate proof states into the script, as source code comments - a tedious and error-prone exercise. Additional prose (such as for a book or tutorial) was likewise embedded in comments, preserving executability at the cost of a mediocre text-editing experience. this paper describes a new approach to the development and dissemination of literate proof scripts, with a focus on the Coq proof assistant. Specifically, we describe two contributions: a compiler that interleaves Coq's output with the original proof script to produce interactive webpages that are complete, self-contained presentations of Coq proofs;and a new literate programming toolkit that allows authors to switch seamlessly between prose- and code-oriented views of the same sources, by translating back and forth between reStructuredText documents and literate Coq source files. In combination, these tools offer a new way to write, communicate, and preserve proofs, combining the flexibility of procedural proof scripts and the intelligibility of declarative proofs.

关键词： literate programming formal verification proof browsing proof presentation

来源：评论

学校读者我要写书评

暂无评论

functional Reactive programming with Liveness Guarantees As relations are to set-valued functions, so event sources are to behaviours

Functional Reactive Programming with Liveness Guarantees As ...

引用

18th acm sigplan international conference on functional programming

作者： Jeffrey, Alan Alcatel Lucent Bell Labs Murray Hill NJ USA

ISBN: (纸本)9781450323260

functional Reactive programming (FRP) is an approach to the development of reactive systems which provides a pure functional interface, but which may be implemented as an abstraction of an imperative event-driven layer. FRP systems typically provide a model of behaviours (total time-indexed values, implemented as pull systems) and event sources (partial time-indexed values, implemented as push systems). In this paper, we investigate a type system for event-driven FRP programs which provide liveness guarantees, that is every input event is guaranteed to generate an output event. We show that FRP can be implemented on top of a model of sets and relations, and that the isomorphism between event sources and behaviours corresponds to the isomorphism between relations and set-valued functions. We then implement sets and relations using a model of continuations using the usual double-negation CPS transform. the implementation of behaviours as pull systems based on futures, and of event sources as push systems based on the observer pattern, thus arises from first principles. We also discuss a Java implementation of the FRP model.

关键词： Design theory functional Reactive programming Concurrency Liveness

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Play on Regular Expressions functional Pearl 10

A Play on Regular Expressions Functional Pearl

引用

15th acm sigplan international conference on functional programming

作者： Fischer, Sebastian Huch, Frank Wilke, thomas Univ Kiel D-24098 Kiel Germany

ISBN: (纸本)9781605587943

Cody, Hazel, and theo, two experienced Haskell programmers and an expert in automata theory, develop an elegant Haskell program for matching regular expressions: (i) the program is purely functional;(ii) it is overloaded over arbitrary semirings, which not only allows to solve the ordinary matching problem but also supports other applications like computing leftmost longest matchings or the number of matchings, all with a single algorithm;(iii) it is more powerful than other matchers, as it can be used for parsing every context-free language by taking advantage of laziness. the developed program is based on an old technique to turn regular expressions into finite automata which makes it efficient both in terms of worst-case time and space bounds and actual performance: despite its simplicity, the Haskell implementation can compete with a recently published professional C++ program for the same problem.

关键词： Algorithms Design regular expressions finite automata Glushkov construction purely functional programming

来源：评论

学校读者我要写书评

暂无评论

Implementing First-Class Polymorphic Delimited Continuations by a Type-Directed Selective CPS-Transform

Implementing First-Class Polymorphic Delimited Continuations...

引用

14th acm sigplan international conference on functional programming

作者： Rompf, Tiark Maier, Ingo Odersky, Martin Ecole Polytech Fed Lausanne Programming Methods Lab LAMP CH-1015 Lausanne Switzerland

ISBN: (纸本)9781605583327

We describe the implementation of first-class polymorphic delimited continuations in the programming language Scala. We use Scala's pluggable typing architecture to implement a simple type and effect system, which discriminates expressions with control effects from those without and accurately tracks answer type modification incurred by control effects. To tackle the problem of implementing first-class continuations under the adverse conditions brought upon by the Java VM, we employ a selective CPS transform, which is driven entirely by effect-annotated types and leaves pure code in direct style. Benchmarks indicate that this high-level approach performs competitively.

关键词： Languages theory Delimited continuations selective CPS transform control effects program transformation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共71页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：