IBM je ob izdaji PL/I jezika ambiciozno dal naslov svojemu priročniku The universal programming language PL/I (IBM Library; 1966). Naslov je odražal IBM-ove cilje za neomejne zmožnosti razširitve: PL/I is designed in such a way that one can isolate subsets from it satisfying the requirements of particular applications. (»PL/I«. Encyclopedia of Mathematics. Arhivirano iz prvotnega spletišča dne 26. aprila 2012. Pridobljeno 29. junija 2006.). Ada in UNCOL sta imela v zgodnji fazi razvoja podobne cilje.
Jeffrey Kegler, "Perl and Undecidability", The Perl Review. Papers 2 and 3 prove, using respectively Rice's theorem and direct reduction to the halting problem, that the parsing of Perl programs is in general undecidable.
Kelsey, Richard; William Clinger; Jonathan Rees (februar 1998). »Section 7.2 Formal semantics«. Revised5 Report on the Algorithmic Language Scheme. Pridobljeno 9. junija 2006.{{navedi splet}}: Vzdrževanje CS1: leto (povezava)
Perlis, Alan (september 1982). »Epigrams on Programming«. SIGPLAN Notices Vol. 17, No. 9. str.7–13. Arhivirano iz prvotnega spletišča dne 17. januarja 1999. Pridobljeno 23. decembra 2013.
Specifically, instantiations of generic types are inferred for certain expression forms. Type inference in Generic Java—the research language that provided the basis for Java 1.5's bounded parametric polymorphism extensions—is discussed in two informal manuscripts from the Types mailing list: Generic Java type inference is unsound (Alan Jeffrey, 17 December 2001) and Sound Generic Java type inference (Martin Odersky, 15 January 2002). C#'s type system is similar to Java's, and uses a similar partial type inference scheme.
IBM je ob izdaji PL/I jezika ambiciozno dal naslov svojemu priročniku The universal programming language PL/I (IBM Library; 1966). Naslov je odražal IBM-ove cilje za neomejne zmožnosti razširitve: PL/I is designed in such a way that one can isolate subsets from it satisfying the requirements of particular applications. (»PL/I«. Encyclopedia of Mathematics. Arhivirano iz prvotnega spletišča dne 26. aprila 2012. Pridobljeno 29. junija 2006.). Ada in UNCOL sta imela v zgodnji fazi razvoja podobne cilje.
Perlis, Alan (september 1982). »Epigrams on Programming«. SIGPLAN Notices Vol. 17, No. 9. str.7–13. Arhivirano iz prvotnega spletišča dne 17. januarja 1999. Pridobljeno 23. decembra 2013.
