An approach to completing variable names for implicitly typed functional languages

DOI10.1007/S10990-013-9095-XMaRDI QIDQ526448zbMATH OpenOpenAlexFDO

Authors Isao Sasano, Takumi Goto

Publication date 15 May 2017

Published in Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10990-013-9095-x

zbMATH Keywords

Emacs-modepolymorphic languagetype inferencevariable name completion

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18)

Recommendations

• Constrained polymorphic types for a calculus with name variables
• The completeness of typing for context-semantics
• scientific article; zbMATH DE number 6123101
• An approach to call-by-name delimited continuations
• Towards static analysis of functional programs using tree automata completion
• Implementing compositional analysis using intersection types with expansion variables
• scientific article; zbMATH DE number 4080884
• Implicit self-adjusting computation for purely functional programs
• Implicit self-adjusting computation for purely functional programs

Cites work

• A Machine-Oriented Logic Based on the Resolution Principle
• A theory of type polymorphism in programming
• An approach to completing variable names for implicitly typed functional languages
• Type error slicing in implicitly typed higher-order languages
• Using types as search keys in function libraries

Cited in

(2)

• Implicit parameters: dynamic scoping with static types
• An approach to completing variable names for implicitly typed functional languages

Describes a project that uses

Uses Software

• ML

This page was built for publication: An approach to completing variable names for implicitly typed functional languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526448)