An approach to completing variable names for implicitly typed functional languages

DOI10.1007/S10990-013-9095-XzbMath1360.68340OpenAlexW2612875137MaRDI QIDQ526448

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

type inferenceEmacs-modepolymorphic languagevariable name completion

Mathematics Subject Classification ID

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

Related Items (1)

An approach to completing variable names for implicitly typed functional languages

Uses Software

• Unnamed Item

Cites Work

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

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