类 型
39 篇文献
 
Notes on Sconing and Relators  
This paper describes a semantics of typed lambda calculi based on relations. The main mathematical tool is a category-theoretic method of sconing, also called glueing or Freyd covers. Its corresponden......
Computer Science Logic  1993
31次引用 0 0
An Equational Presentation of Higher Order Logic  
Without Abstract......
Category Theory and Computer Science  1987
1次引用 0 0
On an Interpretation of Second Order Quantification in First Order Intuitionistic Propositional Logic  
We prove the following surprising property of Heyting's intuitionisticpropositional calculus, IpC. Consider the collection of formulas, OE, builtup from propositional variables (p; q; r; : : :) and fa......
Journal of Symbolic Logic  1992
40次引用 0 0
On functors expressible in the polymorphic typed lambda calculus  
This is a preprint of a paper that has been submitted to Information and Computation.......
Logical Foundations of Functional Programming  1990
10次引用 0 0
Second-Order Type Isomorphisms Through Game Semantics  
Abstract The characterization,of second-order type isomorphisms,is a purely syntactical problem,that we propose,to study under,the enlightenment,of game,semantics. We study this question in the case o......
Computing Research Repository  2007
2次引用 0 0
Bounded Quantifiers Have Interval Models  
We propose a sound model for an extension of the language Fun, proposed by L. Cardelli and P. Wegner as a formalization of the notion of inheritance in the context of higher order polymorphic function......
ACM Conference on LISP and Functional Programming  1988
7次引用 0 0
Bunching for Regions and Locations (Extended Abstract)  
There are a number of applied lambda-calculi in which terms and types are annotated with parameters denoting either regions or locations in machine memory. Such calculi have been designed with safe me......
0次引用 0 0
A Category-theoretic Account of Program Modules  
Abstract The type-theoretic explanation of modules proposed to date (for programming languages like ML) is unsatisfactory, because it does not capture that evaluation of type-expressions is independen......
Category Theory and Computer Science  1989
27次引用 0 0
with Intersection Types and Bounded Polymorphism  
0次引用 0 0
Relating Models of Polymorphism  
A new general notion of model for the polymorphic lambda calculus based on the simple idea of auniverse, is proposed. Although impossible in nonconstructive set theory, the notion is unproblematic for......
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages  1989
4次引用 0 0

1/4 第一页 上一页 1 2 3 4 下一页
Feedback
Feedback
Feedback
我想反馈:
排行榜