Higher-Order and Symbolic Computation
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Conjunction-type standard ML polymorphism
Higher-Order and Symbolic Computation - Tập 3 Số 4 - Trang 381-409 - 1990
A practical approach to type inference for EuLisp
Higher-Order and Symbolic Computation - Tập 6 - Trang 159-175 - 1993
Lisp applications need to show a reasonable cost-benefit relationship between the offered expressiveness and their demand for storage and run-time. Drawbacks in efficiency, apparent inLisp as a dynamically typed programming language, can be avoided by optimizations. Statically inferred type information can be decisive for the success of these optimizations. This paper describes a practical approa...... hiện toàn bộ
Pruning with improving sequences in lazy functional programs
Higher-Order and Symbolic Computation - Tập 24 - Trang 281-309 - 2012
This paper presents a library based on improving sequences and demonstrates that they are effective for pruning unnecessary computations while retaining program clarity. An improving sequence is a monotonic sequence of approximation values of a final value that are improved gradually according to some ordering relation. A computation using improving sequences proceeds by demanding for the next app...... hiện toàn bộ
Scala-Virtualized: linguistic reuse for deep embeddings
Higher-Order and Symbolic Computation - Tập 25 - Trang 165-207 - 2013
Scala-Virtualized extends the Scala language to better support hosting embedded DSLs. Scala is an expressive language that provides a flexible syntax, type-level computation using implicits, and other features that facilitate the development of embedded DSLs. However, many of these features work well only for shallow embeddings, i.e. DSLs which are implemented as plain libraries. Shallow embedding...... hiện toàn bộ
Abstract Models of Storage
Higher-Order and Symbolic Computation - Tập 13 - Trang 119-129 - 2000
This note is a historical survey of Christopher Strachey's influence on the development of semantic models of assignment and storage management in procedural languages.
Types and associated type families for hardware simulation and synthesis
Higher-Order and Symbolic Computation - Tập 25 - Trang 255-274 - 2013
In this article we overview the design and implementation of the second generation of Kansas Lava. Driven by the needs and experiences of implementing telemetry decoders and other circuits, we have made a number of improvements to both the external API and the internal representations used. We have retained our dual shallow/deep representation of signals in general, but now have a number of extern...... hiện toàn bộ
Tổng số: 267
- 1
- 2
- 3
- 4
- 5
- 6
- 10