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

Realization of natural language interfaces using lazy functional programming

ACM COMPUTING SURVEYS 2006年第4期38卷 1-54页

作者： Frost, Richard A. Univ Windsor Windsor ON N9B 3P4 Canada

The construction of natural language interfaces to computers continues to be a major challenge. The need for such interfaces is growing now that speech recognition technology is becoming more readily available, and people cannot speak those computer-oriented formal languages that are frequently used to interact with computer applications. Much of the research related to the design and implementation of natural language interfaces has involved the use of high-level declarative programming languages. This is to be expected as the task is extremely difficult, involving syntactic and semantic analysis of potentially ambiguous input. The use of LISP and Prolog in this area is well documented. However, research involving the relatively new lazy functional programming paradigm is less well known. This paper provides a comprehensive survey of that research.

关键词： languages human factors natural-language interfaces lazy functional programming higher-order functions computational linguistics Montague grammar

来源：评论

学校读者我要写书评

暂无评论

On building cyclic and shared structures in Haskell

引用

FORMAL ASPECTS OF COMPUTING 2012年第4-6期24卷 609-621页

作者： Bird, Richard S. Univ Oxford Dept Comp Sci Oxford OX1 3QD England

We demonstrate how to build certain cyclic and other multi-linked structures in the lazy functional programming language Haskell. No explicit pointers are used in these constructions. Each task is accomplished by star... 详细信息

关键词： Formal program design Program calculation Pointer algorithms Recursive structures lazy functional programming

来源：评论

学校读者我要写书评

暂无评论

A functional Algorithm for Exact Real Integration with Invariant Measures

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2008年第C期218卷 337-353页

作者： Scriven, Adam Univ Birmingham Sch Comp Sci Birmingham W Midlands England

We develop an algorithm for exact real integration over a class of self-similar spaces and measures defined by Hutchinson. We construct the algorithm in an idealised lazy functional programming language and prove its correctness using domain theory. The work generalises an algorithm developed by Alex Simpson for exact Riemann integration over the real line. We implement the algorithm in the functional language Haskell and give some preliminary results.

关键词： Exact real number computation integration self-similarity iterated function system domain theory lazy functional programming Haskell

来源：评论

学校读者我要写书评

暂无评论

Heap Recycling for lazy Languages 08

Heap Recycling for Lazy Languages

引用

ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

作者： Hage, Jurriaan Holdermans, Stefan Univ Utrecht Dept Informat & Comp Sci NL-3508 TB Utrecht Netherlands

ISBN: (纸本)9781595939777

Pure functional programming languages preclude destructive updates of heap-allocated data. In such languages, all newly computed algebraic values claim freshly allocated heap space, which typically causes idiomatic programs to be notoriously inefficient when compared to their imperative and impure counterparts. We partly overcome this shortcoming by considering a syntactically light language construct for enabling user-controlled in-place updates of algebraic values. The resulting calculus, that is based on a combination of type-based uniqueness and constructor analysis, is guaranteed to maintain referential transparency and is fully compatible with existing run-time systems for nonstrict, pure functional languages.

关键词： compile-time garbage collection lazy functional programming type-based program analysis

来源：评论

学校读者我要写书评

暂无评论

An Efficient Representation for lazy Constructors using 64-bit Pointers 3

An Efficient Representation for Lazy Constructors using 64-b...

引用

3rd ACM SIGPLAN Workshop on functional High-Performance Computing (FHPC)

作者： Fourtounis, Georgios Papaspyrou, Nikolaos Natl Tech Univ Athens Sch Elect & Comp Engn Athens Greece

ISBN: (纸本)9781450330404

Pointers in the AMD64 architecture contain unused space, a feature often exploited by modern programming language implementations. We use this property in a defunctionalizing compiler for a subset of Haskell, generating fast programs having a compact memory representation of their runtime structures. We demonstrate that, in most cases, the compact representation is faster, uses less memory and has better cache characteristics. Our prototype shows competitive performance when compared to GHC with full optimizations on.

关键词： lazy functional programming tagged pointers AMD64 compact data representations

来源：评论

学校读者我要写书评

暂无评论

Pretty printing with lazy dequeues

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 2005年第1期27卷 163-184页

作者： Chitil, O Univ Kent Comp Lab Canterbury CT2 7NF Kent England

There are several purely functional libraries for converting tree structured data into indented text, but they all make use of some backtracking. Over twenty years ago, Oppen published a more efficient imperative implementation of a pretty printer. This article shows that the same efficiency is also obtainable without destructive updates by developing a similar but purely functional Haskell implementation with the same complexity bounds. At its heart lie two lazy double ended queues.

关键词： Haskell lazy functional programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：