Filters








24,495 Hits in 9.6 sec

Representation independence and data abstraction

John C. Mitchell
1986 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '86  
Morris anticipated both objects with private state and abstract data types, as well as the connections to observational equivalence.  ...  With the former approach, protected objects are created by exporting functions to manipulate an underlying object instance, without (lexically) exposing that object instance.  ...  The failure to find an adequate domain model led to a flood of papers making additional attempts.  ... 
doi:10.1145/512644.512669 dblp:conf/popl/Mitchell86 fatcat:wvyxgd25yfgsbmiurtgzstkthq

Typed self-representation

Tillman Rendel, Klaus Ostermann, Christian Hofer
2009 Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation - PLDI '09  
This paper makes a big step towards this aim by defining the F * ω calculus, an extension of the higher-order polymorphic lambda calculus Fω that allows typed self-representations.  ...  Although approaches to designing typed program representations for sublanguages of some base language have become quite popular recently, the question whether a fully metacircular typed selfrepresentation  ...  Tillmann Rendel and Christian Hofer are supported by the ScalPL project of the European Research Commission.  ... 
doi:10.1145/1542476.1542509 dblp:conf/pldi/RendelOH09 fatcat:n7wo7dvcczhejlpefudcibuofm

Typed self-representation

Tillman Rendel, Klaus Ostermann, Christian Hofer
2009 SIGPLAN notices  
This paper makes a big step towards this aim by defining the F * ω calculus, an extension of the higher-order polymorphic lambda calculus Fω that allows typed self-representations.  ...  Although approaches to designing typed program representations for sublanguages of some base language have become quite popular recently, the question whether a fully metacircular typed selfrepresentation  ...  Tillmann Rendel and Christian Hofer are supported by the ScalPL project of the European Research Commission.  ... 
doi:10.1145/1543135.1542509 fatcat:mavgwd4novhl5ln3qligy7q46e

Programming in Martin-Löf's type theory

Nax Mendler
1991 Science of Computer Programming  
The subset theory attempts to remedy this by sacrificing the propositions-as-sets correspondence.  ...  The leanest part of t"-e book is given to programming examples, the main two being E.W. Dijkstra's *'Dutc;h National Flag" problem and an abstract data type specification of stacks.  ... 
doi:10.1016/0167-6423(91)90006-j fatcat:3spjvcqtx5gbnjjikimkf7mkiu

LEAP: A language with eval and polymorphism [chapter]

Frank Pfenning, Peter Lee
1989 Lecture Notes in Computer Science  
Somewhat unexpectedly for us, the "tower" begins with an interpreter for the secondorder polymorphic A-calculus (F2) (see Girard [5, 6] and Reynolds [16] ) written in the thirdorder polymorphic A-calculus  ...  We describe the core of a new strongly-typed functional programming language called LEAP, a gL__anguage with E__val And Polymorphism. ~ Pure LEAP is an extension of the co-order polymorphic A-calculus  ...  A c k n o w l e d g e m e n t s The authors would like to thank Christine Paulin-Mohring for pointing out a problem in a purported "proof" of Conjecture 6, and also Ken Cline, Scott Dietzen, Spiro Michaylov  ... 
doi:10.1007/3-540-50940-2_46 fatcat:hv72siuy2ndnpefsnqmultgbya

Parametricity as isomorphism

Edmund Robinson
1994 Theoretical Computer Science  
We investigate a simple form of parametricity, based on adding "abstract" copies of pre-existing types.  ...  Connections are made with the Reynolds-Ma theory of parametricity by logical relations, with the theory of parametricity via dinaturality, and with the categorical notion of equivalence.  ...  Phoa, and an anonymous referee.  ... 
doi:10.1016/0304-3975(94)00126-4 fatcat:7e4gxy3hingzjkkmpykwuckc5a

Metacircularity in the polymorphic λ-calculus

Frank Pfenning, Peter Lee
1991 Theoretical Computer Science  
Lee, Metacircularity in the polymorphic A-calculus, Theoretical Computer Science 89 (1991) 137-159. *  ...  Acknowledgment The authors would like to thank Christine Paulin-Mohring for valuable criticism of an earlier draft and also Ken Cline, Scott Dietzen, Jean Gallier, Robert Harper,  ...  This allows us to build a "tower," starting with an interpreter for Fz written in F3, and then extending to all higher orders by introducing a simple extension to the w-order polymorphic A-calculus (F,  ... 
doi:10.1016/0304-3975(90)90109-u fatcat:oopib6b3djbzvpp3ra6yvvqjym

Partial polymorphic type inference and higher-order unification

Frank Pfenning
1988 Proceedings of the 1988 ACM conference on LISP and functional programming - LFP '88  
We show that the problem of partial type inference in the ntb-order polymorphic X-calculus is equivalent to nthorder unification.  ...  We present an implementation in AProlog in full.  ...  Partial polymorphic type inference, on the olher hand, does not attempt to arbitrarily insert type abstractions and applications, but requires placeholders to be supplied by the user. Thus Xx .  ... 
doi:10.1145/62678.62697 dblp:conf/lfp/Pfenning88 fatcat:urm7ddmgerbirnzzwo6uoquksy

Random testing of a higher-order blockchain language (experience report)

Tram Hoang, Anton Trunov, Leonidas Lampropoulos, Ilya Sergey
2022 Proceedings of the ACM on Programming Languages (PACMPL)  
The properties range from the standard type safety to the soundness of a control- and type-flow analysis used by the optimizing compiler.  ...  We describe our experience of using property-based testing---an approach for automatically generating random inputs to check executable program specifications---in a development of a higher-order smart  ...  The work by Sergey was supported in part by Singapore MoE Tier 1 Grant No. IG18-SG102.  ... 
doi:10.1145/3547653 fatcat:g7k6v4rafjf5lffe7hdvc6fu2a

A Polymorphic Groundness Analysis of Logic Programs [article]

Lunjin Lu
1998 arXiv   pre-print
The polymorphic groundness analysis is designed by replacing two primitive operators used in a monomorphic groundness analysis and is shown to be as precise as the monomorphic groundness analysis for any  ...  A polymorphic analysis is an analysis whose input and output contain parameters which serve as placeholders for information that is unknown before analysis but provided after analysis.  ...  An alternative formulation of a polymorphic abstract interpretation is to define Υ as a function of type P → (A → C).  ... 
arXiv:cs/9811001v1 fatcat:g23646knpbconh7gum6hba4j6y

Using kinds to type partially-polymorphic methods

Daniel Bonniot
2003 Electronical Notes in Theoretical Computer Science  
In the context of object-oriented programming languages, they offer an alternative to the use of F-bounded polymorphism to type homogeneous binary methods.  ...  We also introduce the notion of partially polymorphic methods to describe a common situation in object oriented hierarchies, and show how these can be typed in a modular fashion with kind constraints.  ...  Acknowledgements Thanks to Didier Remy and François Bourdoncle for their support for this work, and to the anonymous reviewers for their helpful comments.  ... 
doi:10.1016/s1571-0661(04)80777-1 fatcat:7insx4iqifemjndjvq7aa3h364

Refinement Type Directed Search for Meta-Interpretive-Learning of Higher-Order Logic Programs [article]

Rolf Morel
2021 arXiv   pre-print
Additionally we are able to infer polymorphic types of synthesized clauses and of entire programs. The other advancement is in developing an approach to leveraging refinement types in ILP.  ...  The introduction of polymorphic type checking to the MIL approach to logic program synthesis is validated by strong theoretical and experimental results, showing a cubic reduction in the size of the search  ...  To prove each goal, first it is attempted to be proven by one of the primitive and interpreted predicates.  ... 
arXiv:2102.12553v1 fatcat:2kzu7fb7efg4no4cqyngzmpvvq

Principal Type Schemes for Modular Programs [chapter]

Derek Dreyer, Matthias Blume
2007 Lecture Notes in Computer Science  
To bolster this claim, we offer a series of short example programs on which no existing SML typechecker follows the behavior prescribed by either formal definition.  ...  It is unclear how to amend the implementations to match the definitions or vice versa.  ...  We write ↑(∆) to denote {α | α ↑ K ∈ ∆}, and ↓(∆) to denote {α | α ↓ K ∈ ∆}. We write basis∆(A) to denote {α ∈ FTV(A) | α ∈ ↓(∆)}. Proposition B.1 (Properties of Auxiliary Judgments).  ... 
doi:10.1007/978-3-540-71316-6_30 fatcat:x4c2gxtq35fadglelefzz5tmze

Safe run-time overloading

Francois Rouaix
1990 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '90  
The type system ensures that a well-typed program has a correct execution, unique up to a semantic equivalence relation, and allows this execution to proceed deterministically, while resolving overloading  ...  We give a dynamic semantics describing a non-dete rministic evaluation, as well as a type discipline (static semantics) supporting type inference.  ...  I am grateful to B. Lang for initiating this work as a formalisation of the implicit typing used in the VTP [Lang 861, and for his support. D. Rbmy explained to me many key points in ML typing. B.  ... 
doi:10.1145/96709.96746 dblp:conf/popl/Rouaix90 fatcat:nrqkvrytdzftdlzqgx4nwz2bqe

Type soundness proofs with definitional interpreters

Nada Amin, Tiark Rompf
2017 SIGPLAN notices  
Introduction The main contribution of this paper is to demonstrate how type soundness for advanced, polymorphic, type systems can be proved with respect to an operational semantics based on high-level,  ...  More generally, with the definitional interpreter approach, we can first generalize runtime typing, and then find a way to incorporate a consistent set of changes back into static typing.  ... 
doi:10.1145/3093333.3009866 fatcat:gmsh3x2nlrbmtdlwkam4p2lmm4
« Previous Showing results 1 — 15 out of 24,495 results