The result was KEEP. postdlf ( talk) 00:36, 7 March 2011 (UTC) reply
PROD contested with no reason given. No outside verifiable significant coverage to establish notability. Yaksar (let's chat) 21:47, 27 February 2011 (UTC) reply
— Ruud 12:04, 1 March 2011 (UTC) replyThe work that is most closely related to Polyphonic C# is that on Join Java [Itzstein and Kearney 2001, 2002]. Join Java, which was initially designed at about the same time as Polyphonic C#, takes almost exactly the same approach to integrating join calculus in a modern object-oriented language. Apart from minor variations of syntax, the main language differences appear to be that Join Java takes a more restrictive approach to inheritance than Polyphonic C# (simply outlawing inheritance from any class that uses join patterns) and that Join Java also allows the programmer to specify whether pattern matching within a class should be sequential or nondeterministic. The implementation of Join Java uses a tree-based pattern-matching library; some further details are given by Itzstein and Jasiunas [2003].
The result was KEEP. postdlf ( talk) 00:36, 7 March 2011 (UTC) reply
PROD contested with no reason given. No outside verifiable significant coverage to establish notability. Yaksar (let's chat) 21:47, 27 February 2011 (UTC) reply
— Ruud 12:04, 1 March 2011 (UTC) replyThe work that is most closely related to Polyphonic C# is that on Join Java [Itzstein and Kearney 2001, 2002]. Join Java, which was initially designed at about the same time as Polyphonic C#, takes almost exactly the same approach to integrating join calculus in a modern object-oriented language. Apart from minor variations of syntax, the main language differences appear to be that Join Java takes a more restrictive approach to inheritance than Polyphonic C# (simply outlawing inheritance from any class that uses join patterns) and that Join Java also allows the programmer to specify whether pattern matching within a class should be sequential or nondeterministic. The implementation of Join Java uses a tree-based pattern-matching library; some further details are given by Itzstein and Jasiunas [2003].