The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 2745 of Mathematical Reviews Vol. , Issue 98E
[page]
1998
Mathematical Reviews
Preserved Fulltext
{For the entire collection see MR 98d:68013.}
98e:03017 03B40
Kuper, Jan (NL-TWEN-C; Enschede)
Usability: formalising (un)definedness in typed lambda calculus. ...
Summary: “We discuss the notion of usability, and propose to take
it as a formalisation of (un)definedness in typed lambda calculi,
especially in calculi based on PCF. ...
Page 2545 of Mathematical Reviews Vol. , Issue 98D
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
: formalising (un)definedness in typed lambda calculus (76-90); Marek Zaionc, Lambda repre- sentation of operations between different term algebras (91-105); Matthias Baaz and Gernot Salzer, Semi-unification ...
Compagnoni, Decidability of higher-order subtyp- ing with intersection types (46-60); Hugo Herbelin, A A-calculus structure isomorphic to Gentzen-style sequent calculus structure (61-75); Jan Kuper, Usability ...
A formalisation of design methods : a lambda-calculus approach to system design with an application to text editing
[article]
1990
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We shall identify a-congruent terms, as is usually done in classical lambda calculus; see e.g. [5] (i) 1 + (x 0 + xt) is a. lambda. term with type 0, provided x 0 , x 1 of type 0. ...
N ote that every type u is of the form u 1 --+ ..• --+ Un--+ 0 which is U1 --+ ( .•• --+ (un--+ 0) ... ). ...
In general, we expect that both the screen and the cursor must he updated, even in case the old origin is still usable. ...
doi:10.6100/ir324749
fatcat:jgws4v7lz5bpdigaxkezwue2uy
Page 72 of Mathematical Reviews Vol. , Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Richard; et al., 98c:03038
Komori, Yuichi see Hirokawa, Sachio; et al., 98b:03021
Kuper, Jan Usability: formalising (un)definedness in typed lambda calculus. ...
Strong normalization in a typed lambda calculus with lambda structured ...
Cumulative Learning in the Lambda Calculus
2015
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In abstraction, syntactic patterns in solutions to past problems are isolated as re-usable units and added to background knowledge. ...
Consequently, notions of entailment, subsumption, refinement, and inverse deduction have direct analogues in the lambda calculus setting. ...
The lambda calculus definedness ordering is one of partial information: a hypothesis specifies a partially defined value in the domain of some type. ...
doi:10.25560/24759
fatcat:uggogyit7vb5xn5dqme25oiuoe
The Coq Proof Assistant, version 8.10.0
[article]
2019
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Here are the most important user-visible changes: Kernel: A notion of primitive object was added to the calculus. ...
This release includes many user-visible changes, including deprecations that are documented in the next subsection, and new features that are documented in the reference manual. ...
Usage The Coq Reference Manual, Release 8.10.0 default on NTFS (Windows) or HFS+ (MacOS X) file systems is on the contrary to disallow two files differing only in the case in the same directory. ...
doi:10.5281/zenodo.3476303
fatcat:nq2hvuywmre3xmbaqly2xxt6za
Variations on a theme of Curry and Howard : the Curry-Howard isomorphism and the proofs-as-programs paradigm adapted to imperative and structured program synthesis
2017
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The idea of separating proofs is essential to the Curry-Howard protocol, identified by Crossley and the author in [PC01], and described in Part II of this thesis. ...
and IV of this thesis are an applications of the protocol, and can be seen as a further argument for the separation of proofs from programs, to achieve a practical approaches to constructive synthesis in ...
to the simply typed Proofs-as-programs 9 lambda calculus. ...
doi:10.4225/03/59c9fe4995db8
fatcat:xtbydkjgrrb2xh6n75nvery7ka
A mechanized Theory of Aspects
[article]
2010
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
These type systems enforce static type safety on aspects, while maintaining modularity and thus re-usability. This approach is also used [...] ...
Basic concepts such as the locality of errors, type soundness and re-usability can thus be harmed by aspects. ...
These type systems enforce static type safety on aspects, while maintaining modularity and thus re-usability. ...
doi:10.14279/depositonce-2501
fatcat:535e54yvmzfa7it6irj6svhmve
Set based failure diagnosis for concurrent constraint programming
[article]
2004
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Turner and Benjamin Pierce for discussions on the π-calculus and about typed concurrent programming; Didier Rémy for an email conversation about issues on types in programming languages; ...
In this thesis we investigate two approaches of making static type checking available for Oz: Set-based failure diagnosis and strong typing. ...
Strong typing is usually formalised in two steps. First, one determines the run-time situations that one wants to exclude as type errors. ...
doi:10.22028/d291-25722
fatcat:wuc4nibn6natrcqcbgmi7svx5a